Diff of the two buildlogs: -- --- b1/build.log 2024-11-13 07:03:01.250415973 +0000 +++ b2/build.log 2024-11-13 07:10:37.594134574 +0000 @@ -1,6 +1,6 @@ I: pbuilder: network access will be disabled during build -I: Current time: Tue Nov 12 18:52:34 -12 2024 -I: pbuilder-time-stamp: 1731480754 +I: Current time: Wed Nov 13 21:03:56 +14 2024 +I: pbuilder-time-stamp: 1731481436 I: Building the build Environment I: extracting base tarball [/var/cache/pbuilder/trixie-reproducible-base.tgz] I: copying local configuration @@ -26,52 +26,84 @@ dpkg-source: info: unpacking veryfasttree_4.0.4+dfsg-1.debian.tar.xz I: Not using root during the build. I: Installing the build-deps -I: user script /srv/workspace/pbuilder/29534/tmp/hooks/D02_print_environment starting +I: user script /srv/workspace/pbuilder/29151/tmp/hooks/D01_modify_environment starting +debug: Running on virt32a. +I: Changing host+domainname to test build reproducibility +I: Adding a custom variable just for the fun of it... +I: Changing /bin/sh to bash +'/bin/sh' -> '/bin/bash' +lrwxrwxrwx 1 root root 9 Nov 13 07:04 /bin/sh -> /bin/bash +I: Setting pbuilder2's login shell to /bin/bash +I: Setting pbuilder2's GECOS to second user,second room,second work-phone,second home-phone,second other +I: user script /srv/workspace/pbuilder/29151/tmp/hooks/D01_modify_environment finished +I: user script /srv/workspace/pbuilder/29151/tmp/hooks/D02_print_environment starting I: set - BUILDDIR='/build/reproducible-path' - BUILDUSERGECOS='first user,first room,first work-phone,first home-phone,first other' - BUILDUSERNAME='pbuilder1' - BUILD_ARCH='armhf' - DEBIAN_FRONTEND='noninteractive' - DEB_BUILD_OPTIONS='buildinfo=+all reproducible=+all parallel=5 ' - DISTRIBUTION='trixie' - HOME='/root' - HOST_ARCH='armhf' + BASH=/bin/sh + BASHOPTS=checkwinsize:cmdhist:complete_fullquote:extquote:force_fignore:globasciiranges:globskipdots:hostcomplete:interactive_comments:patsub_replacement:progcomp:promptvars:sourcepath + BASH_ALIASES=() + BASH_ARGC=() + BASH_ARGV=() + BASH_CMDS=() + BASH_LINENO=([0]="12" [1]="0") + BASH_LOADABLES_PATH=/usr/local/lib/bash:/usr/lib/bash:/opt/local/lib/bash:/usr/pkg/lib/bash:/opt/pkg/lib/bash:. + BASH_SOURCE=([0]="/tmp/hooks/D02_print_environment" [1]="/tmp/hooks/D02_print_environment") + BASH_VERSINFO=([0]="5" [1]="2" [2]="32" [3]="1" [4]="release" [5]="arm-unknown-linux-gnueabihf") + BASH_VERSION='5.2.32(1)-release' + BUILDDIR=/build/reproducible-path + BUILDUSERGECOS='second user,second room,second work-phone,second home-phone,second other' + BUILDUSERNAME=pbuilder2 + BUILD_ARCH=armhf + DEBIAN_FRONTEND=noninteractive + DEB_BUILD_OPTIONS='buildinfo=+all reproducible=+all parallel=4 ' + DIRSTACK=() + DISTRIBUTION=trixie + EUID=0 + FUNCNAME=([0]="Echo" [1]="main") + GROUPS=() + HOME=/root + HOSTNAME=i-capture-the-hostname + HOSTTYPE=arm + HOST_ARCH=armhf IFS=' ' - INVOCATION_ID='120501d847494b28add51f34a286466d' - LANG='C' - LANGUAGE='en_US:en' - LC_ALL='C' - MAIL='/var/mail/root' - OPTIND='1' - PATH='/usr/sbin:/usr/bin:/sbin:/bin:/usr/games' - PBCURRENTCOMMANDLINEOPERATION='build' - PBUILDER_OPERATION='build' - PBUILDER_PKGDATADIR='/usr/share/pbuilder' - PBUILDER_PKGLIBDIR='/usr/lib/pbuilder' - PBUILDER_SYSCONFDIR='/etc' - PPID='29534' - PS1='# ' - PS2='> ' + INVOCATION_ID=4b29f35adb6a4c9ea36e36d953005f48 + LANG=C + LANGUAGE=it_CH:it + LC_ALL=C + MACHTYPE=arm-unknown-linux-gnueabihf + MAIL=/var/mail/root + OPTERR=1 + OPTIND=1 + OSTYPE=linux-gnueabihf + PATH=/usr/sbin:/usr/bin:/sbin:/bin:/usr/games:/i/capture/the/path + PBCURRENTCOMMANDLINEOPERATION=build + PBUILDER_OPERATION=build + PBUILDER_PKGDATADIR=/usr/share/pbuilder + PBUILDER_PKGLIBDIR=/usr/lib/pbuilder + PBUILDER_SYSCONFDIR=/etc + PIPESTATUS=([0]="0") + POSIXLY_CORRECT=y + PPID=29151 PS4='+ ' - PWD='/' - SHELL='/bin/bash' - SHLVL='2' - SUDO_COMMAND='/usr/bin/timeout -k 18.1h 18h /usr/bin/ionice -c 3 /usr/bin/nice /usr/sbin/pbuilder --build --configfile /srv/reproducible-results/rbuild-debian/r-b-build.rcoAuJco/pbuilderrc_ADbM --distribution trixie --hookdir /etc/pbuilder/first-build-hooks --debbuildopts -b --basetgz /var/cache/pbuilder/trixie-reproducible-base.tgz --buildresult /srv/reproducible-results/rbuild-debian/r-b-build.rcoAuJco/b1 --logfile b1/build.log veryfasttree_4.0.4+dfsg-1.dsc' - SUDO_GID='114' - SUDO_UID='109' - SUDO_USER='jenkins' - TERM='unknown' - TZ='/usr/share/zoneinfo/Etc/GMT+12' - USER='root' - _='/usr/bin/systemd-run' - http_proxy='http://10.0.0.15:3142/' + PWD=/ + SHELL=/bin/bash + SHELLOPTS=braceexpand:errexit:hashall:interactive-comments:posix + SHLVL=3 + SUDO_COMMAND='/usr/bin/timeout -k 24.1h 24h /usr/bin/ionice -c 3 /usr/bin/nice -n 11 /usr/bin/unshare --uts -- /usr/sbin/pbuilder --build --configfile /srv/reproducible-results/rbuild-debian/r-b-build.rcoAuJco/pbuilderrc_zRDv --distribution trixie --hookdir /etc/pbuilder/rebuild-hooks --debbuildopts -b --basetgz /var/cache/pbuilder/trixie-reproducible-base.tgz --buildresult /srv/reproducible-results/rbuild-debian/r-b-build.rcoAuJco/b2 --logfile b2/build.log veryfasttree_4.0.4+dfsg-1.dsc' + SUDO_GID=113 + SUDO_UID=107 + SUDO_USER=jenkins + TERM=unknown + TZ=/usr/share/zoneinfo/Etc/GMT-14 + UID=0 + USER=root + _='I: set' + http_proxy=http://10.0.0.15:3142/ I: uname -a - Linux ff64a 6.1.0-27-arm64 #1 SMP Debian 6.1.115-1 (2024-11-01) aarch64 GNU/Linux + Linux i-capture-the-hostname 6.1.0-27-armmp-lpae #1 SMP Debian 6.1.115-1 (2024-11-01) armv7l GNU/Linux I: ls -l /bin lrwxrwxrwx 1 root root 7 Aug 4 21:30 /bin -> usr/bin -I: user script /srv/workspace/pbuilder/29534/tmp/hooks/D02_print_environment finished +I: user script /srv/workspace/pbuilder/29151/tmp/hooks/D02_print_environment finished -> Attempting to satisfy build-dependencies -> Creating pbuilder-satisfydepends-dummy package Package: pbuilder-satisfydepends-dummy @@ -178,7 +210,7 @@ Get: 57 http://deb.debian.org/debian trixie/main armhf libxxhash-dev armhf 0.8.2-2+b2 [90.6 kB] Get: 58 http://deb.debian.org/debian trixie/main armhf robin-map-dev all 1.3.0-1 [29.8 kB] Get: 59 http://deb.debian.org/debian trixie/main armhf zlib1g-dev armhf 1:1.3.dfsg+really1.3.1-1+b1 [905 kB] -Fetched 41.8 MB in 3s (16.0 MB/s) +Fetched 41.8 MB in 1s (41.5 MB/s) debconf: delaying package configuration, since apt-utils is not installed Selecting previously unselected package libproc2-0:armhf. (Reading database ... (Reading database ... 5% (Reading database ... 10% (Reading database ... 15% (Reading database ... 20% (Reading database ... 25% (Reading database ... 30% (Reading database ... 35% (Reading database ... 40% (Reading database ... 45% (Reading database ... 50% (Reading database ... 55% (Reading database ... 60% (Reading database ... 65% (Reading database ... 70% (Reading database ... 75% (Reading database ... 80% (Reading database ... 85% (Reading database ... 90% (Reading database ... 95% (Reading database ... 100% (Reading database ... 19690 files and directories currently installed.) @@ -429,7 +461,11 @@ Building tag database... -> Finished parsing the build-deps I: Building the package -I: Running cd /build/reproducible-path/veryfasttree-4.0.4+dfsg/ && env PATH="/usr/sbin:/usr/bin:/sbin:/bin:/usr/games" HOME="/nonexistent/first-build" dpkg-buildpackage -us -uc -b && env PATH="/usr/sbin:/usr/bin:/sbin:/bin:/usr/games" HOME="/nonexistent/first-build" dpkg-genchanges -S > ../veryfasttree_4.0.4+dfsg-1_source.changes +I: user script /srv/workspace/pbuilder/29151/tmp/hooks/A99_set_merged_usr starting +Not re-configuring usrmerge for trixie +I: user script /srv/workspace/pbuilder/29151/tmp/hooks/A99_set_merged_usr finished +hostname: Name or service not known +I: Running cd /build/reproducible-path/veryfasttree-4.0.4+dfsg/ && env PATH="/usr/sbin:/usr/bin:/sbin:/bin:/usr/games:/i/capture/the/path" HOME="/nonexistent/second-build" dpkg-buildpackage -us -uc -b && env PATH="/usr/sbin:/usr/bin:/sbin:/bin:/usr/games:/i/capture/the/path" HOME="/nonexistent/second-build" dpkg-genchanges -S > ../veryfasttree_4.0.4+dfsg-1_source.changes dpkg-buildpackage: info: source package veryfasttree dpkg-buildpackage: info: source version 4.0.4+dfsg-1 dpkg-buildpackage: info: source distribution unstable @@ -468,8 +504,8 @@ -- Found OpenMP_C: -fopenmp (found version "4.5") -- Found OpenMP_CXX: -fopenmp (found version "4.5") -- Found OpenMP: TRUE (found version "4.5") --- Configuring done (7.7s) --- Generating done (0.1s) +-- Configuring done (3.2s) +-- Generating done (0.0s) CMake Warning: Manually-specified variables were not used by the project: @@ -487,7 +523,7 @@ debian/rules override_dh_auto_build make[1]: Entering directory '/build/reproducible-path/veryfasttree-4.0.4+dfsg' dh_auto_build - cd obj-arm-linux-gnueabihf && make -j5 "INSTALL=install --strip-program=true" VERBOSE=1 + cd obj-arm-linux-gnueabihf && make -j4 "INSTALL=install --strip-program=true" VERBOSE=1 make[2]: Entering directory '/build/reproducible-path/veryfasttree-4.0.4+dfsg/obj-arm-linux-gnueabihf' /usr/bin/cmake -S/build/reproducible-path/veryfasttree-4.0.4+dfsg -B/build/reproducible-path/veryfasttree-4.0.4+dfsg/obj-arm-linux-gnueabihf --check-build-system CMakeFiles/Makefile.cmake 0 /usr/bin/cmake -E cmake_progress_start /build/reproducible-path/veryfasttree-4.0.4+dfsg/obj-arm-linux-gnueabihf/CMakeFiles /build/reproducible-path/veryfasttree-4.0.4+dfsg/obj-arm-linux-gnueabihf//CMakeFiles/progress.marks @@ -499,36 +535,34 @@ make[4]: Leaving directory '/build/reproducible-path/veryfasttree-4.0.4+dfsg/obj-arm-linux-gnueabihf' make -f CMakeFiles/VeryFastTree.dir/build.make CMakeFiles/VeryFastTree.dir/build make[4]: Entering directory '/build/reproducible-path/veryfasttree-4.0.4+dfsg/obj-arm-linux-gnueabihf' -[ 12%] Building CXX object CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeDouble.cpp.o [ 12%] Building CXX object CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeDoubleAVX256.cpp.o -[ 18%] Building CXX object CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeDoubleAVX512.cpp.o +[ 12%] Building CXX object CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeDouble.cpp.o +[ 18%] Building CXX object CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeDoubleCuda.cpp.o /usr/bin/c++ -DCLI11_BOOST_OPTIONAL=0 -DNDEBUG -I/build/reproducible-path/veryfasttree-4.0.4+dfsg/libs/CLI11/include -I/build/reproducible-path/veryfasttree-4.0.4+dfsg/libs/bxzstr/include -g -O2 -ffile-prefix-map=/build/reproducible-path/veryfasttree-4.0.4+dfsg=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -O3 -DUSE_CUDA=0 -std=gnu++11 -fopenmp -MD -MT CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeDouble.cpp.o -MF CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeDouble.cpp.o.d -o CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeDouble.cpp.o -c /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/VeryFastTreeDouble.cpp -[ 25%] Building CXX object CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeDoubleCuda.cpp.o /usr/bin/c++ -DCLI11_BOOST_OPTIONAL=0 -DNDEBUG -I/build/reproducible-path/veryfasttree-4.0.4+dfsg/libs/CLI11/include -I/build/reproducible-path/veryfasttree-4.0.4+dfsg/libs/bxzstr/include -g -O2 -ffile-prefix-map=/build/reproducible-path/veryfasttree-4.0.4+dfsg=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -O3 -DUSE_CUDA=0 -std=gnu++11 -fopenmp -MD -MT CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeDoubleAVX256.cpp.o -MF CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeDoubleAVX256.cpp.o.d -o CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeDoubleAVX256.cpp.o -c /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/VeryFastTreeDoubleAVX256.cpp +[ 25%] Building CXX object CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeDoubleAVX512.cpp.o +/usr/bin/c++ -DCLI11_BOOST_OPTIONAL=0 -DNDEBUG -I/build/reproducible-path/veryfasttree-4.0.4+dfsg/libs/CLI11/include -I/build/reproducible-path/veryfasttree-4.0.4+dfsg/libs/bxzstr/include -g -O2 -ffile-prefix-map=/build/reproducible-path/veryfasttree-4.0.4+dfsg=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -O3 -DUSE_CUDA=0 -std=gnu++11 -fopenmp -MD -MT CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeDoubleCuda.cpp.o -MF CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeDoubleCuda.cpp.o.d -o CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeDoubleCuda.cpp.o -c /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/VeryFastTreeDoubleCuda.cpp /usr/bin/c++ -DCLI11_BOOST_OPTIONAL=0 -DNDEBUG -I/build/reproducible-path/veryfasttree-4.0.4+dfsg/libs/CLI11/include -I/build/reproducible-path/veryfasttree-4.0.4+dfsg/libs/bxzstr/include -g -O2 -ffile-prefix-map=/build/reproducible-path/veryfasttree-4.0.4+dfsg=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -O3 -DUSE_CUDA=0 -std=gnu++11 -fopenmp -MD -MT CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeDoubleAVX512.cpp.o -MF CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeDoubleAVX512.cpp.o.d -o CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeDoubleAVX512.cpp.o -c /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/VeryFastTreeDoubleAVX512.cpp [ 31%] Building CXX object CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeDoubleSSE128.cpp.o -/usr/bin/c++ -DCLI11_BOOST_OPTIONAL=0 -DNDEBUG -I/build/reproducible-path/veryfasttree-4.0.4+dfsg/libs/CLI11/include -I/build/reproducible-path/veryfasttree-4.0.4+dfsg/libs/bxzstr/include -g -O2 -ffile-prefix-map=/build/reproducible-path/veryfasttree-4.0.4+dfsg=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -O3 -DUSE_CUDA=0 -std=gnu++11 -fopenmp -MD -MT CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeDoubleCuda.cpp.o -MF CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeDoubleCuda.cpp.o.d -o CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeDoubleCuda.cpp.o -c /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/VeryFastTreeDoubleCuda.cpp /usr/bin/c++ -DCLI11_BOOST_OPTIONAL=0 -DNDEBUG -I/build/reproducible-path/veryfasttree-4.0.4+dfsg/libs/CLI11/include -I/build/reproducible-path/veryfasttree-4.0.4+dfsg/libs/bxzstr/include -g -O2 -ffile-prefix-map=/build/reproducible-path/veryfasttree-4.0.4+dfsg=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -O3 -DUSE_CUDA=0 -std=gnu++11 -fopenmp -MD -MT CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeDoubleSSE128.cpp.o -MF CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeDoubleSSE128.cpp.o.d -o CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeDoubleSSE128.cpp.o -c /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/VeryFastTreeDoubleSSE128.cpp [ 37%] Building CXX object CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeFloat.cpp.o -[ 43%] Building CXX object CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeFloatAVX256.cpp.o /usr/bin/c++ -DCLI11_BOOST_OPTIONAL=0 -DNDEBUG -I/build/reproducible-path/veryfasttree-4.0.4+dfsg/libs/CLI11/include -I/build/reproducible-path/veryfasttree-4.0.4+dfsg/libs/bxzstr/include -g -O2 -ffile-prefix-map=/build/reproducible-path/veryfasttree-4.0.4+dfsg=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -O3 -DUSE_CUDA=0 -std=gnu++11 -fopenmp -MD -MT CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeFloat.cpp.o -MF CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeFloat.cpp.o.d -o CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeFloat.cpp.o -c /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/VeryFastTreeFloat.cpp -[ 50%] Building CXX object CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeFloatAVX512.cpp.o +[ 43%] Building CXX object CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeFloatAVX256.cpp.o /usr/bin/c++ -DCLI11_BOOST_OPTIONAL=0 -DNDEBUG -I/build/reproducible-path/veryfasttree-4.0.4+dfsg/libs/CLI11/include -I/build/reproducible-path/veryfasttree-4.0.4+dfsg/libs/bxzstr/include -g -O2 -ffile-prefix-map=/build/reproducible-path/veryfasttree-4.0.4+dfsg=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -O3 -DUSE_CUDA=0 -std=gnu++11 -fopenmp -MD -MT CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeFloatAVX256.cpp.o -MF CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeFloatAVX256.cpp.o.d -o CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeFloatAVX256.cpp.o -c /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/VeryFastTreeFloatAVX256.cpp +[ 50%] Building CXX object CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeFloatAVX512.cpp.o /usr/bin/c++ -DCLI11_BOOST_OPTIONAL=0 -DNDEBUG -I/build/reproducible-path/veryfasttree-4.0.4+dfsg/libs/CLI11/include -I/build/reproducible-path/veryfasttree-4.0.4+dfsg/libs/bxzstr/include -g -O2 -ffile-prefix-map=/build/reproducible-path/veryfasttree-4.0.4+dfsg=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -O3 -DUSE_CUDA=0 -std=gnu++11 -fopenmp -MD -MT CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeFloatAVX512.cpp.o -MF CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeFloatAVX512.cpp.o.d -o CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeFloatAVX512.cpp.o -c /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/VeryFastTreeFloatAVX512.cpp [ 56%] Building CXX object CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeFloatCuda.cpp.o /usr/bin/c++ -DCLI11_BOOST_OPTIONAL=0 -DNDEBUG -I/build/reproducible-path/veryfasttree-4.0.4+dfsg/libs/CLI11/include -I/build/reproducible-path/veryfasttree-4.0.4+dfsg/libs/bxzstr/include -g -O2 -ffile-prefix-map=/build/reproducible-path/veryfasttree-4.0.4+dfsg=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -O3 -DUSE_CUDA=0 -std=gnu++11 -fopenmp -MD -MT CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeFloatCuda.cpp.o -MF CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeFloatCuda.cpp.o.d -o CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeFloatCuda.cpp.o -c /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/VeryFastTreeFloatCuda.cpp [ 62%] Building CXX object CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeFloatSSE128.cpp.o -/usr/bin/c++ -DCLI11_BOOST_OPTIONAL=0 -DNDEBUG -I/build/reproducible-path/veryfasttree-4.0.4+dfsg/libs/CLI11/include -I/build/reproducible-path/veryfasttree-4.0.4+dfsg/libs/bxzstr/include -g -O2 -ffile-prefix-map=/build/reproducible-path/veryfasttree-4.0.4+dfsg=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -O3 -DUSE_CUDA=0 -std=gnu++11 -fopenmp -MD -MT CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeFloatSSE128.cpp.o -MF CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeFloatSSE128.cpp.o.d -o CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeFloatSSE128.cpp.o -c /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/VeryFastTreeFloatSSE128.cpp [ 68%] Building CXX object CMakeFiles/VeryFastTree.dir/src/Knuth.cpp.o /usr/bin/c++ -DCLI11_BOOST_OPTIONAL=0 -DNDEBUG -I/build/reproducible-path/veryfasttree-4.0.4+dfsg/libs/CLI11/include -I/build/reproducible-path/veryfasttree-4.0.4+dfsg/libs/bxzstr/include -g -O2 -ffile-prefix-map=/build/reproducible-path/veryfasttree-4.0.4+dfsg=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -O3 -DUSE_CUDA=0 -std=gnu++11 -fopenmp -MD -MT CMakeFiles/VeryFastTree.dir/src/Knuth.cpp.o -MF CMakeFiles/VeryFastTree.dir/src/Knuth.cpp.o.d -o CMakeFiles/VeryFastTree.dir/src/Knuth.cpp.o -c /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/Knuth.cpp +/usr/bin/c++ -DCLI11_BOOST_OPTIONAL=0 -DNDEBUG -I/build/reproducible-path/veryfasttree-4.0.4+dfsg/libs/CLI11/include -I/build/reproducible-path/veryfasttree-4.0.4+dfsg/libs/bxzstr/include -g -O2 -ffile-prefix-map=/build/reproducible-path/veryfasttree-4.0.4+dfsg=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -O3 -DUSE_CUDA=0 -std=gnu++11 -fopenmp -MD -MT CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeFloatSSE128.cpp.o -MF CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeFloatSSE128.cpp.o.d -o CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeFloatSSE128.cpp.o -c /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/VeryFastTreeFloatSSE128.cpp [ 75%] Building CXX object CMakeFiles/VeryFastTree.dir/src/DiskMemory.cpp.o /usr/bin/c++ -DCLI11_BOOST_OPTIONAL=0 -DNDEBUG -I/build/reproducible-path/veryfasttree-4.0.4+dfsg/libs/CLI11/include -I/build/reproducible-path/veryfasttree-4.0.4+dfsg/libs/bxzstr/include -g -O2 -ffile-prefix-map=/build/reproducible-path/veryfasttree-4.0.4+dfsg=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -O3 -DUSE_CUDA=0 -std=gnu++11 -fopenmp -MD -MT CMakeFiles/VeryFastTree.dir/src/DiskMemory.cpp.o -MF CMakeFiles/VeryFastTree.dir/src/DiskMemory.cpp.o.d -o CMakeFiles/VeryFastTree.dir/src/DiskMemory.cpp.o -c /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/DiskMemory.cpp [ 81%] Building CXX object CMakeFiles/VeryFastTree.dir/src/Alignment.cpp.o /usr/bin/c++ -DCLI11_BOOST_OPTIONAL=0 -DNDEBUG -I/build/reproducible-path/veryfasttree-4.0.4+dfsg/libs/CLI11/include -I/build/reproducible-path/veryfasttree-4.0.4+dfsg/libs/bxzstr/include -g -O2 -ffile-prefix-map=/build/reproducible-path/veryfasttree-4.0.4+dfsg=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -O3 -DUSE_CUDA=0 -std=gnu++11 -fopenmp -MD -MT CMakeFiles/VeryFastTree.dir/src/Alignment.cpp.o -MF CMakeFiles/VeryFastTree.dir/src/Alignment.cpp.o.d -o CMakeFiles/VeryFastTree.dir/src/Alignment.cpp.o -c /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/Alignment.cpp [ 87%] Building CXX object CMakeFiles/VeryFastTree.dir/src/VeryFastTree.cpp.o /usr/bin/c++ -DCLI11_BOOST_OPTIONAL=0 -DNDEBUG -I/build/reproducible-path/veryfasttree-4.0.4+dfsg/libs/CLI11/include -I/build/reproducible-path/veryfasttree-4.0.4+dfsg/libs/bxzstr/include -g -O2 -ffile-prefix-map=/build/reproducible-path/veryfasttree-4.0.4+dfsg=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -O3 -DUSE_CUDA=0 -std=gnu++11 -fopenmp -MD -MT CMakeFiles/VeryFastTree.dir/src/VeryFastTree.cpp.o -MF CMakeFiles/VeryFastTree.dir/src/VeryFastTree.cpp.o.d -o CMakeFiles/VeryFastTree.dir/src/VeryFastTree.cpp.o -c /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/VeryFastTree.cpp -[ 93%] Building CXX object CMakeFiles/VeryFastTree.dir/main.cpp.o -/usr/bin/c++ -DCLI11_BOOST_OPTIONAL=0 -DNDEBUG -I/build/reproducible-path/veryfasttree-4.0.4+dfsg/libs/CLI11/include -I/build/reproducible-path/veryfasttree-4.0.4+dfsg/libs/bxzstr/include -g -O2 -ffile-prefix-map=/build/reproducible-path/veryfasttree-4.0.4+dfsg=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -O3 -DUSE_CUDA=0 -std=gnu++11 -fopenmp -MD -MT CMakeFiles/VeryFastTree.dir/main.cpp.o -MF CMakeFiles/VeryFastTree.dir/main.cpp.o.d -o CMakeFiles/VeryFastTree.dir/main.cpp.o -c /build/reproducible-path/veryfasttree-4.0.4+dfsg/main.cpp In file included from /usr/include/c++/14/vector:72, from /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/Alignment.h:5, from /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/Alignment.cpp:2: @@ -536,6 +570,8 @@ /usr/include/c++/14/bits/vector.tcc:700:5: note: parameter passing for argument of type 'std::vector::iterator' changed in GCC 7.1 700 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ +[ 93%] Building CXX object CMakeFiles/VeryFastTree.dir/main.cpp.o +/usr/bin/c++ -DCLI11_BOOST_OPTIONAL=0 -DNDEBUG -I/build/reproducible-path/veryfasttree-4.0.4+dfsg/libs/CLI11/include -I/build/reproducible-path/veryfasttree-4.0.4+dfsg/libs/bxzstr/include -g -O2 -ffile-prefix-map=/build/reproducible-path/veryfasttree-4.0.4+dfsg=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -O3 -DUSE_CUDA=0 -std=gnu++11 -fopenmp -MD -MT CMakeFiles/VeryFastTree.dir/main.cpp.o -MF CMakeFiles/VeryFastTree.dir/main.cpp.o.d -o CMakeFiles/VeryFastTree.dir/main.cpp.o -c /build/reproducible-path/veryfasttree-4.0.4+dfsg/main.cpp In file included from /usr/include/c++/14/vector:66: In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = long long int; _Alloc = std::allocator]', inlined from 'veryfasttree::Uniquify::Uniquify(veryfasttree::Alignment&)' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/Alignment.cpp:501:19: @@ -552,6 +588,24 @@ from /usr/include/boost/sort/sample_sort/sample_sort.hpp:25, from /usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:23, from /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../Utils.h:41, + from /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/VeryFastTreeFloat.cpp:1: +/usr/include/boost/sort/common/util/merge.hpp: In function 'Value_t* boost::sort::common::util::merge_construct(Iter1_t, Iter1_t, Iter2_t, Iter2_t, Value_t*, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Value_t = veryfasttree::NeighbourJoining::Besthit; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]': +/usr/include/boost/sort/common/util/merge.hpp:147:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 147 | static Value_t *merge_construct(Iter1_t first1, const Iter1_t last1, + | ^~~~~~~~~~~~~~~ +/usr/include/boost/sort/common/util/merge.hpp:147:17: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +/usr/include/boost/sort/common/util/merge.hpp:147:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +/usr/include/boost/sort/common/util/merge.hpp:147:17: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +/usr/include/boost/sort/common/util/merge.hpp: In function 'Value_t* boost::sort::common::util::merge_construct(Iter1_t, Iter1_t, Iter2_t, Iter2_t, Value_t*, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Value_t = veryfasttree::NeighbourJoining::Besthit; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]': +/usr/include/boost/sort/common/util/merge.hpp:147:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +/usr/include/boost/sort/common/util/merge.hpp:147:17: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +/usr/include/boost/sort/common/util/merge.hpp:147:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +/usr/include/boost/sort/common/util/merge.hpp:147:17: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +In file included from /usr/include/boost/sort/common/range.hpp:22, + from /usr/include/boost/sort/spinsort/spinsort.hpp:28, + from /usr/include/boost/sort/sample_sort/sample_sort.hpp:25, + from /usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:23, + from /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../Utils.h:41, from /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/VeryFastTreeDouble.cpp:1: /usr/include/boost/sort/common/util/merge.hpp: In function 'Value_t* boost::sort::common::util::merge_construct(Iter1_t, Iter1_t, Iter2_t, Iter2_t, Value_t*, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Value_t = veryfasttree::NeighbourJoining::Besthit; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]': /usr/include/boost/sort/common/util/merge.hpp:147:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 @@ -560,11 +614,25 @@ /usr/include/boost/sort/common/util/merge.hpp:147:17: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 /usr/include/boost/sort/common/util/merge.hpp:147:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 /usr/include/boost/sort/common/util/merge.hpp:147:17: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +/usr/include/boost/sort/common/util/merge.hpp: In function 'Iter3_t boost::sort::common::util::merge(Iter1_t, Iter1_t, Iter2_t, Iter2_t, Iter3_t, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter3_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]': +/usr/include/boost/sort/common/util/merge.hpp:86:16: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 86 | static Iter3_t merge(Iter1_t buf1, const Iter1_t end_buf1, Iter2_t buf2, + | ^~~~~ +/usr/include/boost/sort/common/util/merge.hpp:86:16: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +/usr/include/boost/sort/common/util/merge.hpp:86:16: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +/usr/include/boost/sort/common/util/merge.hpp:86:16: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 /usr/include/boost/sort/common/util/merge.hpp: In function 'Value_t* boost::sort::common::util::merge_construct(Iter1_t, Iter1_t, Iter2_t, Iter2_t, Value_t*, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Value_t = veryfasttree::NeighbourJoining::Besthit; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]': /usr/include/boost/sort/common/util/merge.hpp:147:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 /usr/include/boost/sort/common/util/merge.hpp:147:17: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 /usr/include/boost/sort/common/util/merge.hpp:147:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 /usr/include/boost/sort/common/util/merge.hpp:147:17: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +/usr/include/boost/sort/common/util/merge.hpp: In function 'Iter3_t boost::sort::common::util::merge(Iter1_t, Iter1_t, Iter2_t, Iter2_t, Iter3_t, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Iter3_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]': +/usr/include/boost/sort/common/util/merge.hpp:86:16: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +/usr/include/boost/sort/common/util/merge.hpp: In function 'Iter3_t boost::sort::common::util::merge(Iter1_t, Iter1_t, Iter2_t, Iter2_t, Iter3_t, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter3_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]': +/usr/include/boost/sort/common/util/merge.hpp:86:16: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +/usr/include/boost/sort/common/util/merge.hpp:86:16: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +/usr/include/boost/sort/common/util/merge.hpp:86:16: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +/usr/include/boost/sort/common/util/merge.hpp:86:16: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 /usr/include/boost/sort/common/util/merge.hpp: In function 'Iter3_t boost::sort::common::util::merge(Iter1_t, Iter1_t, Iter2_t, Iter2_t, Iter3_t, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter3_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]': /usr/include/boost/sort/common/util/merge.hpp:86:16: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 86 | static Iter3_t merge(Iter1_t buf1, const Iter1_t end_buf1, Iter2_t buf2, @@ -572,13 +640,38 @@ /usr/include/boost/sort/common/util/merge.hpp:86:16: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 /usr/include/boost/sort/common/util/merge.hpp:86:16: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 /usr/include/boost/sort/common/util/merge.hpp:86:16: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +/usr/include/boost/sort/common/util/merge.hpp: In function 'Iter3_t boost::sort::common::util::merge(Iter1_t, Iter1_t, Iter2_t, Iter2_t, Iter3_t, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Iter3_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]': +/usr/include/boost/sort/common/util/merge.hpp:86:16: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +In file included from /usr/include/boost/sort/spinsort/spinsort.hpp:25: +/usr/include/boost/sort/insert_sort/insert_sort.hpp: In function 'void boost::sort::insert_sort(Iter_t, Iter_t, Compare) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]': +/usr/include/boost/sort/insert_sort/insert_sort.hpp:40:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 40 | static void insert_sort (Iter_t first, Iter_t last, + | ^~~~~~~~~~~ +/usr/include/boost/sort/insert_sort/insert_sort.hpp:40:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 /usr/include/boost/sort/common/util/merge.hpp: In function 'Iter3_t boost::sort::common::util::merge(Iter1_t, Iter1_t, Iter2_t, Iter2_t, Iter3_t, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Iter3_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]': /usr/include/boost/sort/common/util/merge.hpp:86:16: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +/usr/include/boost/sort/common/util/merge.hpp: In function 'Iter2_t boost::sort::common::util::merge_half(Iter1_t, Iter1_t, Iter2_t, Iter2_t, Iter2_t, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]': +/usr/include/boost/sort/common/util/merge.hpp:211:16: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 211 | static Iter2_t merge_half(Iter1_t buf1, const Iter1_t end_buf1, Iter2_t buf2, + | ^~~~~~~~~~ +/usr/include/boost/sort/common/util/merge.hpp:211:16: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +/usr/include/boost/sort/common/util/merge.hpp:211:16: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +/usr/include/boost/sort/insert_sort/insert_sort.hpp: In function 'void boost::sort::insert_sort(Iter_t, Iter_t, Compare) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]': +/usr/include/boost/sort/insert_sort/insert_sort.hpp:40:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 40 | static void insert_sort (Iter_t first, Iter_t last, + | ^~~~~~~~~~~ +/usr/include/boost/sort/insert_sort/insert_sort.hpp:40:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 /usr/include/boost/sort/common/util/merge.hpp: In function 'Iter3_t boost::sort::common::util::merge(Iter1_t, Iter1_t, Iter2_t, Iter2_t, Iter3_t, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter3_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]': /usr/include/boost/sort/common/util/merge.hpp:86:16: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 /usr/include/boost/sort/common/util/merge.hpp:86:16: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 /usr/include/boost/sort/common/util/merge.hpp:86:16: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 /usr/include/boost/sort/common/util/merge.hpp:86:16: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +/usr/include/boost/sort/common/util/merge.hpp: In function 'Iter2_t boost::sort::common::util::merge_half(Iter1_t, Iter1_t, Iter2_t, Iter2_t, Iter2_t, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]': +/usr/include/boost/sort/common/util/merge.hpp:211:16: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 211 | static Iter2_t merge_half(Iter1_t buf1, const Iter1_t end_buf1, Iter2_t buf2, + | ^~~~~~~~~~ +/usr/include/boost/sort/common/util/merge.hpp:211:16: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +/usr/include/boost/sort/common/util/merge.hpp:211:16: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 /usr/include/boost/sort/common/util/merge.hpp: In function 'Iter3_t boost::sort::common::util::merge(Iter1_t, Iter1_t, Iter2_t, Iter2_t, Iter3_t, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Iter3_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]': /usr/include/boost/sort/common/util/merge.hpp:86:16: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 In file included from /usr/include/boost/sort/spinsort/spinsort.hpp:25: @@ -604,118 +697,61 @@ | ^~~~~~~~~~ /usr/include/boost/sort/common/util/merge.hpp:211:16: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 /usr/include/boost/sort/common/util/merge.hpp:211:16: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +/usr/include/boost/sort/insert_sort/insert_sort.hpp: In function 'void boost::sort::insert_sort(Iter_t, Iter_t, Compare) [with Iter_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]': +/usr/include/boost/sort/insert_sort/insert_sort.hpp:40:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 + 40 | static void insert_sort (Iter_t first, Iter_t last, + | ^~~~~~~~~~~ +/usr/include/boost/sort/insert_sort/insert_sort.hpp:40:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 /usr/include/boost/sort/insert_sort/insert_sort.hpp: In function 'void boost::sort::insert_sort(Iter_t, Iter_t, Compare) [with Iter_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]': /usr/include/boost/sort/insert_sort/insert_sort.hpp:40:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 40 | static void insert_sort (Iter_t first, Iter_t last, | ^~~~~~~~~~~ /usr/include/boost/sort/insert_sort/insert_sort.hpp:40:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 -In file included from /usr/include/boost/sort/common/range.hpp:22, - from /usr/include/boost/sort/spinsort/spinsort.hpp:28, - from /usr/include/boost/sort/sample_sort/sample_sort.hpp:25, - from /usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:23, - from /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../Utils.h:41, - from /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/VeryFastTreeFloat.cpp:1: -/usr/include/boost/sort/common/util/merge.hpp: In function 'Value_t* boost::sort::common::util::merge_construct(Iter1_t, Iter1_t, Iter2_t, Iter2_t, Value_t*, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Value_t = veryfasttree::NeighbourJoining::Besthit; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]': -/usr/include/boost/sort/common/util/merge.hpp:147:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 147 | static Value_t *merge_construct(Iter1_t first1, const Iter1_t last1, - | ^~~~~~~~~~~~~~~ -/usr/include/boost/sort/common/util/merge.hpp:147:17: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -/usr/include/boost/sort/common/util/merge.hpp:147:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -/usr/include/boost/sort/common/util/merge.hpp:147:17: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -/usr/include/boost/sort/common/util/merge.hpp: In function 'Value_t* boost::sort::common::util::merge_construct(Iter1_t, Iter1_t, Iter2_t, Iter2_t, Value_t*, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Value_t = veryfasttree::NeighbourJoining::Besthit; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]': -/usr/include/boost/sort/common/util/merge.hpp:147:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -/usr/include/boost/sort/common/util/merge.hpp:147:17: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -/usr/include/boost/sort/common/util/merge.hpp:147:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -/usr/include/boost/sort/common/util/merge.hpp:147:17: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -/usr/include/boost/sort/common/util/merge.hpp: In function 'Iter3_t boost::sort::common::util::merge(Iter1_t, Iter1_t, Iter2_t, Iter2_t, Iter3_t, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter3_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]': -/usr/include/boost/sort/common/util/merge.hpp:86:16: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 86 | static Iter3_t merge(Iter1_t buf1, const Iter1_t end_buf1, Iter2_t buf2, - | ^~~~~ -/usr/include/boost/sort/common/util/merge.hpp:86:16: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -/usr/include/boost/sort/common/util/merge.hpp:86:16: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -/usr/include/boost/sort/common/util/merge.hpp:86:16: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -/usr/include/boost/sort/common/util/merge.hpp: In function 'Iter2_t boost::sort::common::util::merge_half(Iter1_t, Iter1_t, Iter2_t, Iter2_t, Iter2_t, Compare) [with Iter1_t = long long int*; Iter2_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]': +/usr/include/boost/sort/common/util/merge.hpp: In function 'Iter2_t boost::sort::common::util::merge_half(Iter1_t, Iter1_t, Iter2_t, Iter2_t, Iter2_t, Compare) [with Iter1_t = long long int*; Iter2_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]': /usr/include/boost/sort/common/util/merge.hpp:211:16: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 211 | static Iter2_t merge_half(Iter1_t buf1, const Iter1_t end_buf1, Iter2_t buf2, | ^~~~~~~~~~ /usr/include/boost/sort/common/util/merge.hpp:211:16: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 /usr/include/boost/sort/common/util/merge.hpp:211:16: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 -/usr/include/boost/sort/common/util/merge.hpp: In function 'Iter3_t boost::sort::common::util::merge(Iter1_t, Iter1_t, Iter2_t, Iter2_t, Iter3_t, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = __gnu_cxx::__normal_iterator >; Iter3_t = long long int*; Compare = veryfasttree::NeighbourJoining::CompareSeeds]': +/usr/include/boost/sort/common/util/merge.hpp: In function 'Iter3_t boost::sort::common::util::merge(Iter1_t, Iter1_t, Iter2_t, Iter2_t, Iter3_t, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = __gnu_cxx::__normal_iterator >; Iter3_t = long long int*; Compare = veryfasttree::NeighbourJoining::CompareSeeds]': /usr/include/boost/sort/common/util/merge.hpp:86:16: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 86 | static Iter3_t merge(Iter1_t buf1, const Iter1_t end_buf1, Iter2_t buf2, | ^~~~~ /usr/include/boost/sort/common/util/merge.hpp:86:16: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 /usr/include/boost/sort/common/util/merge.hpp:86:16: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 /usr/include/boost/sort/common/util/merge.hpp:86:16: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 -/usr/include/boost/sort/common/util/merge.hpp: In function 'Iter3_t boost::sort::common::util::merge(Iter1_t, Iter1_t, Iter2_t, Iter2_t, Iter3_t, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Iter3_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]': -/usr/include/boost/sort/common/util/merge.hpp:86:16: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -/usr/include/boost/sort/common/util/merge.hpp: In function 'Value_t* boost::sort::common::util::merge_construct(Iter1_t, Iter1_t, Iter2_t, Iter2_t, Value_t*, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = __gnu_cxx::__normal_iterator >; Value_t = long long int; Compare = veryfasttree::NeighbourJoining::CompareSeeds]': +/usr/include/boost/sort/common/util/merge.hpp: In function 'Iter2_t boost::sort::common::util::merge_half(Iter1_t, Iter1_t, Iter2_t, Iter2_t, Iter2_t, Compare) [with Iter1_t = long long int*; Iter2_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]': +/usr/include/boost/sort/common/util/merge.hpp:211:16: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 + 211 | static Iter2_t merge_half(Iter1_t buf1, const Iter1_t end_buf1, Iter2_t buf2, + | ^~~~~~~~~~ +/usr/include/boost/sort/common/util/merge.hpp:211:16: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 +/usr/include/boost/sort/common/util/merge.hpp:211:16: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 +/usr/include/boost/sort/common/util/merge.hpp: In function 'Value_t* boost::sort::common::util::merge_construct(Iter1_t, Iter1_t, Iter2_t, Iter2_t, Value_t*, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = __gnu_cxx::__normal_iterator >; Value_t = long long int; Compare = veryfasttree::NeighbourJoining::CompareSeeds]': /usr/include/boost/sort/common/util/merge.hpp:147:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 147 | static Value_t *merge_construct(Iter1_t first1, const Iter1_t last1, | ^~~~~~~~~~~~~~~ /usr/include/boost/sort/common/util/merge.hpp:147:17: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 /usr/include/boost/sort/common/util/merge.hpp:147:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 /usr/include/boost/sort/common/util/merge.hpp:147:17: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 -/usr/include/boost/sort/common/util/merge.hpp: In function 'Iter3_t boost::sort::common::util::merge(Iter1_t, Iter1_t, Iter2_t, Iter2_t, Iter3_t, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter3_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]': -/usr/include/boost/sort/common/util/merge.hpp:86:16: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -/usr/include/boost/sort/common/util/merge.hpp:86:16: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -/usr/include/boost/sort/common/util/merge.hpp:86:16: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -/usr/include/boost/sort/common/util/merge.hpp:86:16: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -/usr/include/boost/sort/common/util/merge.hpp: In function 'Iter3_t boost::sort::common::util::merge(Iter1_t, Iter1_t, Iter2_t, Iter2_t, Iter3_t, Compare) [with Iter1_t = long long int*; Iter2_t = long long int*; Iter3_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]': -/usr/include/boost/sort/common/util/merge.hpp:86:16: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 86 | static Iter3_t merge(Iter1_t buf1, const Iter1_t end_buf1, Iter2_t buf2, - | ^~~~~ -/usr/include/boost/sort/common/util/merge.hpp: In function 'Iter3_t boost::sort::common::util::merge(Iter1_t, Iter1_t, Iter2_t, Iter2_t, Iter3_t, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Iter3_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]': -/usr/include/boost/sort/common/util/merge.hpp:86:16: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -In file included from /usr/include/boost/sort/spinsort/spinsort.hpp:25: -/usr/include/boost/sort/insert_sort/insert_sort.hpp: In function 'void boost::sort::insert_sort(Iter_t, Iter_t, Compare) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]': -/usr/include/boost/sort/insert_sort/insert_sort.hpp:40:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 40 | static void insert_sort (Iter_t first, Iter_t last, - | ^~~~~~~~~~~ -/usr/include/boost/sort/insert_sort/insert_sort.hpp:40:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -/usr/include/boost/sort/common/util/merge.hpp: In function 'Iter2_t boost::sort::common::util::merge_half(Iter1_t, Iter1_t, Iter2_t, Iter2_t, Iter2_t, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]': -/usr/include/boost/sort/common/util/merge.hpp:211:16: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 211 | static Iter2_t merge_half(Iter1_t buf1, const Iter1_t end_buf1, Iter2_t buf2, - | ^~~~~~~~~~ -/usr/include/boost/sort/common/util/merge.hpp:211:16: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -/usr/include/boost/sort/common/util/merge.hpp:211:16: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -/usr/include/boost/sort/insert_sort/insert_sort.hpp: In function 'void boost::sort::insert_sort(Iter_t, Iter_t, Compare) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]': -/usr/include/boost/sort/insert_sort/insert_sort.hpp:40:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 40 | static void insert_sort (Iter_t first, Iter_t last, - | ^~~~~~~~~~~ -/usr/include/boost/sort/insert_sort/insert_sort.hpp:40:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -/usr/include/boost/sort/common/util/merge.hpp: In function 'Iter2_t boost::sort::common::util::merge_half(Iter1_t, Iter1_t, Iter2_t, Iter2_t, Iter2_t, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]': -/usr/include/boost/sort/common/util/merge.hpp:211:16: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 211 | static Iter2_t merge_half(Iter1_t buf1, const Iter1_t end_buf1, Iter2_t buf2, - | ^~~~~~~~~~ -/usr/include/boost/sort/common/util/merge.hpp:211:16: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -/usr/include/boost/sort/common/util/merge.hpp:211:16: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -/usr/include/boost/sort/insert_sort/insert_sort.hpp: In function 'void boost::sort::insert_sort(Iter_t, Iter_t, Compare) [with Iter_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]': -/usr/include/boost/sort/insert_sort/insert_sort.hpp:40:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 40 | static void insert_sort (Iter_t first, Iter_t last, - | ^~~~~~~~~~~ -/usr/include/boost/sort/insert_sort/insert_sort.hpp:40:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 -/usr/include/boost/sort/common/util/merge.hpp: In function 'Iter2_t boost::sort::common::util::merge_half(Iter1_t, Iter1_t, Iter2_t, Iter2_t, Iter2_t, Compare) [with Iter1_t = long long int*; Iter2_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]': -/usr/include/boost/sort/common/util/merge.hpp:211:16: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 211 | static Iter2_t merge_half(Iter1_t buf1, const Iter1_t end_buf1, Iter2_t buf2, - | ^~~~~~~~~~ -/usr/include/boost/sort/common/util/merge.hpp:211:16: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 -/usr/include/boost/sort/common/util/merge.hpp:211:16: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 -/usr/include/boost/sort/common/util/merge.hpp: In function 'Iter3_t boost::sort::common::util::merge(Iter1_t, Iter1_t, Iter2_t, Iter2_t, Iter3_t, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = __gnu_cxx::__normal_iterator >; Iter3_t = long long int*; Compare = veryfasttree::NeighbourJoining::CompareSeeds]': +/usr/include/boost/sort/common/util/merge.hpp: In function 'Iter3_t boost::sort::common::util::merge(Iter1_t, Iter1_t, Iter2_t, Iter2_t, Iter3_t, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = __gnu_cxx::__normal_iterator >; Iter3_t = long long int*; Compare = veryfasttree::NeighbourJoining::CompareSeeds]': /usr/include/boost/sort/common/util/merge.hpp:86:16: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 86 | static Iter3_t merge(Iter1_t buf1, const Iter1_t end_buf1, Iter2_t buf2, | ^~~~~ /usr/include/boost/sort/common/util/merge.hpp:86:16: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 /usr/include/boost/sort/common/util/merge.hpp:86:16: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 /usr/include/boost/sort/common/util/merge.hpp:86:16: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 -/usr/include/boost/sort/common/util/merge.hpp: In function 'Value_t* boost::sort::common::util::merge_construct(Iter1_t, Iter1_t, Iter2_t, Iter2_t, Value_t*, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = __gnu_cxx::__normal_iterator >; Value_t = long long int; Compare = veryfasttree::NeighbourJoining::CompareSeeds]': +/usr/include/boost/sort/common/util/merge.hpp: In function 'Iter3_t boost::sort::common::util::merge(Iter1_t, Iter1_t, Iter2_t, Iter2_t, Iter3_t, Compare) [with Iter1_t = long long int*; Iter2_t = long long int*; Iter3_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]': +/usr/include/boost/sort/common/util/merge.hpp:86:16: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 + 86 | static Iter3_t merge(Iter1_t buf1, const Iter1_t end_buf1, Iter2_t buf2, + | ^~~~~ +/usr/include/boost/sort/common/util/merge.hpp: In function 'Value_t* boost::sort::common::util::merge_construct(Iter1_t, Iter1_t, Iter2_t, Iter2_t, Value_t*, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = __gnu_cxx::__normal_iterator >; Value_t = long long int; Compare = veryfasttree::NeighbourJoining::CompareSeeds]': /usr/include/boost/sort/common/util/merge.hpp:147:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 147 | static Value_t *merge_construct(Iter1_t first1, const Iter1_t last1, | ^~~~~~~~~~~~~~~ /usr/include/boost/sort/common/util/merge.hpp:147:17: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 /usr/include/boost/sort/common/util/merge.hpp:147:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 /usr/include/boost/sort/common/util/merge.hpp:147:17: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 -/usr/include/boost/sort/common/util/merge.hpp: In function 'Iter3_t boost::sort::common::util::merge(Iter1_t, Iter1_t, Iter2_t, Iter2_t, Iter3_t, Compare) [with Iter1_t = long long int*; Iter2_t = long long int*; Iter3_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]': +/usr/include/boost/sort/common/util/merge.hpp: In function 'Iter3_t boost::sort::common::util::merge(Iter1_t, Iter1_t, Iter2_t, Iter2_t, Iter3_t, Compare) [with Iter1_t = long long int*; Iter2_t = long long int*; Iter3_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]': /usr/include/boost/sort/common/util/merge.hpp:86:16: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 86 | static Iter3_t merge(Iter1_t buf1, const Iter1_t end_buf1, Iter2_t buf2, | ^~~~~ @@ -727,6 +763,16 @@ | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/14/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_fill_insert(iterator, size_type, const value_type&) [with _Tp = long long int; _Alloc = std::allocator]': /usr/include/c++/14/bits/vector.tcc:700:5: note: parameter passing for argument of type 'std::vector::iterator' changed in GCC 7.1 +In file included from /usr/include/c++/14/vector:72, + from /usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:22: +/usr/include/c++/14/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_fill_insert(iterator, size_type, const value_type&) [with _Tp = long long int; _Alloc = std::allocator]': +/usr/include/c++/14/bits/vector.tcc:700:5: note: parameter passing for argument of type 'std::vector::iterator' changed in GCC 7.1 + 700 | vector<_Tp, _Alloc>:: + | ^~~~~~~~~~~~~~~~~~~ +/usr/include/c++/14/bits/vector.tcc: In member function 'std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(const_iterator, const value_type&) [with _Tp = long long int; _Alloc = std::allocator]': +/usr/include/c++/14/bits/vector.tcc:133:5: note: parameter passing for argument of type 'std::vector::const_iterator' changed in GCC 7.1 + 133 | vector<_Tp, _Alloc>:: + | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/14/bits/vector.tcc: In member function 'std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(const_iterator, const value_type&) [with _Tp = long long int; _Alloc = std::allocator]': /usr/include/c++/14/bits/vector.tcc:133:5: note: parameter passing for argument of type 'std::vector::const_iterator' changed in GCC 7.1 133 | vector<_Tp, _Alloc>:: @@ -745,70 +791,47 @@ inlined from 'void std::__cxx11::_List_base<_Tp, _Alloc>::_M_put_node(typename _Node_alloc_traits::pointer) [with _Tp = double; _Alloc = std::allocator]' at /usr/include/c++/14/bits/stl_list.h:522:39, inlined from 'void std::__cxx11::list<_Tp, _Alloc>::_M_erase(iterator) [with _Tp = double; _Alloc = std::allocator]' at /usr/include/c++/14/bits/stl_list.h:2023:13, inlined from 'void std::__cxx11::list<_Tp, _Alloc>::pop_front() [with _Tp = double; _Alloc = std::allocator]' at /usr/include/c++/14/bits/stl_list.h:1292:23, - inlined from 'veryfasttree::NeighbourJoining::treePartitioning(int)::' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:5660:31, - inlined from 'std::vector veryfasttree::NeighbourJoining::treePartitioning(int) [with Precision = double; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:5674:17: + inlined from 'veryfasttree::NeighbourJoining::treePartitioning(int)::' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:5660:31, + inlined from 'std::vector veryfasttree::NeighbourJoining::treePartitioning(int) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:5674:17: /usr/include/c++/14/bits/new_allocator.h:172:33: warning: 'void operator delete(void*)' called on unallocated object 'tendency' [-Wfree-nonheap-object] 172 | _GLIBCXX_OPERATOR_DELETE(_GLIBCXX_SIZED_DEALLOC(__p, __n)); | ^ In file included from /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.h:845, from /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../VeyFastTreeImpl.h:15, - from /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/VeryFastTreeDouble.cpp:3: -/build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc: In member function 'std::vector veryfasttree::NeighbourJoining::treePartitioning(int) [with Precision = double; Operations = veryfasttree::BasicOperations]': + from /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/VeryFastTreeFloat.cpp:3: +/build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc: In member function 'std::vector veryfasttree::NeighbourJoining::treePartitioning(int) [with Precision = float; Operations = veryfasttree::BasicOperations]': /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:5626:23: note: declared here 5626 | std::list tendency; | ^~~~~~~~ In lambda function, - inlined from 'std::vector veryfasttree::NeighbourJoining::treePartitioning(int) [with Precision = double; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:5668:15: + inlined from 'std::vector veryfasttree::NeighbourJoining::treePartitioning(int) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:5668:15: /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:5638:28: note: parameter passing for argument of type 'std::vector::const_iterator' changed in GCC 7.1 5638 | solution.insert(std::lower_bound(solution.begin(), solution.end(), node, cmp), node); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In lambda function, - inlined from 'std::vector veryfasttree::NeighbourJoining::treePartitioning(int) [with Precision = double; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:5671:32: + inlined from 'std::vector veryfasttree::NeighbourJoining::treePartitioning(int) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:5671:32: /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:5614:28: note: parameter passing for argument of type 'std::vector::const_iterator' changed in GCC 7.1 5614 | work.insert(std::lower_bound(work.begin(), work.end(), minwork, | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 5615 | [](int64_t a, int64_t b) { return b < a; }), minwork); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In lambda function, - inlined from 'std::vector veryfasttree::NeighbourJoining::treePartitioning(int) [with Precision = double; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:5680:15: + inlined from 'std::vector veryfasttree::NeighbourJoining::treePartitioning(int) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:5680:15: /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:5638:28: note: parameter passing for argument of type 'std::vector::const_iterator' changed in GCC 7.1 5638 | solution.insert(std::lower_bound(solution.begin(), solution.end(), node, cmp), node); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In lambda function, - inlined from 'std::vector veryfasttree::NeighbourJoining::treePartitioning(int) [with Precision = double; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:5681:15: + inlined from 'std::vector veryfasttree::NeighbourJoining::treePartitioning(int) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:5681:15: /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:5638:28: note: parameter passing for argument of type 'std::vector::const_iterator' changed in GCC 7.1 5638 | solution.insert(std::lower_bound(solution.begin(), solution.end(), node, cmp), node); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In lambda function, - inlined from 'std::vector veryfasttree::NeighbourJoining::treePartitioning(int) [with Precision = double; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:5682:36: + inlined from 'std::vector veryfasttree::NeighbourJoining::treePartitioning(int) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:5682:36: /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:5614:28: note: parameter passing for argument of type 'std::vector::const_iterator' changed in GCC 7.1 5614 | work.insert(std::lower_bound(work.begin(), work.end(), minwork, | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 5615 | [](int64_t a, int64_t b) { return b < a; }), minwork); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -In file included from /usr/include/c++/14/vector:72, - from /usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:22: -/usr/include/c++/14/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_fill_insert(iterator, size_type, const value_type&) [with _Tp = long long int; _Alloc = std::allocator]': -/usr/include/c++/14/bits/vector.tcc:700:5: note: parameter passing for argument of type 'std::vector::iterator' changed in GCC 7.1 - 700 | vector<_Tp, _Alloc>:: - | ^~~~~~~~~~~~~~~~~~~ -/usr/include/c++/14/bits/vector.tcc: In member function 'std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(const_iterator, const value_type&) [with _Tp = long long int; _Alloc = std::allocator]': -/usr/include/c++/14/bits/vector.tcc:133:5: note: parameter passing for argument of type 'std::vector::const_iterator' changed in GCC 7.1 - 133 | vector<_Tp, _Alloc>:: - | ^~~~~~~~~~~~~~~~~~~ -In file included from /usr/include/c++/14/vector:66: -In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]', - inlined from 'void veryfasttree::NeighbourJoining::Rates::reset(int64_t, int64_t) [with Precision = double; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:191:17, - inlined from 'void veryfasttree::NeighbourJoining::setMLRates() [with Precision = double; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:5431:16: -/usr/include/c++/14/bits/stl_vector.h:1037:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 1037 | _M_fill_insert(end(), __new_size - size(), __x); - | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = long long int; _Alloc = std::allocator]', - inlined from 'void veryfasttree::NeighbourJoining::Rates::reset(int64_t, int64_t) [with Precision = double; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:192:19, - inlined from 'void veryfasttree::NeighbourJoining::setMLRates() [with Precision = double; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:5431:16: -/usr/include/c++/14/bits/stl_vector.h:1037:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 1037 | _M_fill_insert(end(), __new_size - size(), __x); - | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/arm-linux-gnueabihf/c++/14/bits/c++allocator.h:33, from /usr/include/c++/14/bits/allocator.h:46, from /usr/include/c++/14/string:43, @@ -823,47 +846,139 @@ inlined from 'void std::__cxx11::_List_base<_Tp, _Alloc>::_M_put_node(typename _Node_alloc_traits::pointer) [with _Tp = double; _Alloc = std::allocator]' at /usr/include/c++/14/bits/stl_list.h:522:39, inlined from 'void std::__cxx11::list<_Tp, _Alloc>::_M_erase(iterator) [with _Tp = double; _Alloc = std::allocator]' at /usr/include/c++/14/bits/stl_list.h:2023:13, inlined from 'void std::__cxx11::list<_Tp, _Alloc>::pop_front() [with _Tp = double; _Alloc = std::allocator]' at /usr/include/c++/14/bits/stl_list.h:1292:23, - inlined from 'veryfasttree::NeighbourJoining::treePartitioning(int)::' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:5660:31, - inlined from 'std::vector veryfasttree::NeighbourJoining::treePartitioning(int) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:5674:17: + inlined from 'veryfasttree::NeighbourJoining::treePartitioning(int)::' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:5660:31, + inlined from 'std::vector veryfasttree::NeighbourJoining::treePartitioning(int) [with Precision = double; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:5674:17: /usr/include/c++/14/bits/new_allocator.h:172:33: warning: 'void operator delete(void*)' called on unallocated object 'tendency' [-Wfree-nonheap-object] 172 | _GLIBCXX_OPERATOR_DELETE(_GLIBCXX_SIZED_DEALLOC(__p, __n)); | ^ In file included from /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.h:845, from /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../VeyFastTreeImpl.h:15, - from /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/VeryFastTreeFloat.cpp:3: -/build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc: In member function 'std::vector veryfasttree::NeighbourJoining::treePartitioning(int) [with Precision = float; Operations = veryfasttree::BasicOperations]': + from /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/VeryFastTreeDouble.cpp:3: +/build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc: In member function 'std::vector veryfasttree::NeighbourJoining::treePartitioning(int) [with Precision = double; Operations = veryfasttree::BasicOperations]': /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:5626:23: note: declared here 5626 | std::list tendency; | ^~~~~~~~ In lambda function, - inlined from 'std::vector veryfasttree::NeighbourJoining::treePartitioning(int) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:5668:15: + inlined from 'std::vector veryfasttree::NeighbourJoining::treePartitioning(int) [with Precision = double; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:5668:15: /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:5638:28: note: parameter passing for argument of type 'std::vector::const_iterator' changed in GCC 7.1 5638 | solution.insert(std::lower_bound(solution.begin(), solution.end(), node, cmp), node); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In lambda function, - inlined from 'std::vector veryfasttree::NeighbourJoining::treePartitioning(int) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:5671:32: + inlined from 'std::vector veryfasttree::NeighbourJoining::treePartitioning(int) [with Precision = double; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:5671:32: /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:5614:28: note: parameter passing for argument of type 'std::vector::const_iterator' changed in GCC 7.1 5614 | work.insert(std::lower_bound(work.begin(), work.end(), minwork, | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 5615 | [](int64_t a, int64_t b) { return b < a; }), minwork); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In lambda function, - inlined from 'std::vector veryfasttree::NeighbourJoining::treePartitioning(int) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:5680:15: + inlined from 'std::vector veryfasttree::NeighbourJoining::treePartitioning(int) [with Precision = double; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:5680:15: /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:5638:28: note: parameter passing for argument of type 'std::vector::const_iterator' changed in GCC 7.1 5638 | solution.insert(std::lower_bound(solution.begin(), solution.end(), node, cmp), node); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In lambda function, - inlined from 'std::vector veryfasttree::NeighbourJoining::treePartitioning(int) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:5681:15: + inlined from 'std::vector veryfasttree::NeighbourJoining::treePartitioning(int) [with Precision = double; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:5681:15: /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:5638:28: note: parameter passing for argument of type 'std::vector::const_iterator' changed in GCC 7.1 5638 | solution.insert(std::lower_bound(solution.begin(), solution.end(), node, cmp), node); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In lambda function, - inlined from 'std::vector veryfasttree::NeighbourJoining::treePartitioning(int) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:5682:36: + inlined from 'std::vector veryfasttree::NeighbourJoining::treePartitioning(int) [with Precision = double; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:5682:36: /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:5614:28: note: parameter passing for argument of type 'std::vector::const_iterator' changed in GCC 7.1 5614 | work.insert(std::lower_bound(work.begin(), work.end(), minwork, | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 5615 | [](int64_t a, int64_t b) { return b < a; }), minwork); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +In file included from /usr/include/c++/14/vector:66: +In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]', + inlined from 'void veryfasttree::NeighbourJoining::Rates::reset(int64_t, int64_t) [with Precision = double; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:191:17, + inlined from 'void veryfasttree::NeighbourJoining::setMLRates() [with Precision = double; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:5431:16: +/usr/include/c++/14/bits/stl_vector.h:1037:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 + 1037 | _M_fill_insert(end(), __new_size - size(), __x); + | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = long long int; _Alloc = std::allocator]', + inlined from 'void veryfasttree::NeighbourJoining::Rates::reset(int64_t, int64_t) [with Precision = double; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:192:19, + inlined from 'void veryfasttree::NeighbourJoining::setMLRates() [with Precision = double; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:5431:16: +/usr/include/c++/14/bits/stl_vector.h:1037:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 + 1037 | _M_fill_insert(end(), __new_size - size(), __x); + | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +In file included from /usr/include/c++/14/vector:66: +In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = long long int; _Alloc = std::allocator]', + inlined from 'void veryfasttree::NeighbourJoining::Rates::reset(int64_t, int64_t) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:192:19, + inlined from 'void veryfasttree::NeighbourJoining::setMLRates() [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:5431:16: +/usr/include/c++/14/bits/stl_vector.h:1037:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 + 1037 | _M_fill_insert(end(), __new_size - size(), __x); + | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +In member function 'void veryfasttree::NeighbourJoining::Profile::setVectorSize(size_t, veryfasttree::NeighbourJoining::numeric_t, bool) [with Precision = float; Operations = veryfasttree::BasicOperations]', + inlined from 'void veryfasttree::NeighbourJoining::Profile::reset() [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:175:18, + inlined from 'veryfasttree::NeighbourJoining::Profile::Profile(int64_t, int64_t) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:26:10, + inlined from 'double veryfasttree::NeighbourJoining::MLQuartetOptimize(Profile&, Profile&, Profile&, Profile&, double*, bool*, double*) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:1670:13: +/build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:104:24: warning: array subscript -1 is outside array bounds of 'void [536870911]' [-Warray-bounds=] + 104 | DynDiskMemory *disk = (DynDiskMemory * ) * (((uintptr_t *) codes) - 1); + | ^~~~ +In constructor 'veryfasttree::NeighbourJoining::Profile::Profile(int64_t, int64_t) [with Precision = float; Operations = veryfasttree::BasicOperations]', + inlined from 'double veryfasttree::NeighbourJoining::MLQuartetOptimize(Profile&, Profile&, Profile&, Profile&, double*, bool*, double*) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:1670:13: +/build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:16:13: note: at offset -4 into object of size [0, 536870911] allocated by 'operator new []' + 16 | codes = new char[nPos]; + | ^~~~~~~~~~~~~~ +In member function 'void veryfasttree::NeighbourJoining::Profile::setVectorSize(size_t, veryfasttree::NeighbourJoining::numeric_t, bool) [with Precision = float; Operations = veryfasttree::BasicOperations]', + inlined from 'void veryfasttree::NeighbourJoining::Profile::reset() [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:175:18, + inlined from 'veryfasttree::NeighbourJoining::Profile::Profile(int64_t, int64_t) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:26:10, + inlined from 'double veryfasttree::NeighbourJoining::MLQuartetOptimize(Profile&, Profile&, Profile&, Profile&, double*, bool*, double*) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:1671:13: +/build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:104:24: warning: array subscript -1 is outside array bounds of 'void [536870911]' [-Warray-bounds=] + 104 | DynDiskMemory *disk = (DynDiskMemory * ) * (((uintptr_t *) codes) - 1); + | ^~~~ +In constructor 'veryfasttree::NeighbourJoining::Profile::Profile(int64_t, int64_t) [with Precision = float; Operations = veryfasttree::BasicOperations]', + inlined from 'double veryfasttree::NeighbourJoining::MLQuartetOptimize(Profile&, Profile&, Profile&, Profile&, double*, bool*, double*) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:1671:13: +/build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:16:13: note: at offset -4 into object of size [0, 536870911] allocated by 'operator new []' + 16 | codes = new char[nPos]; + | ^~~~~~~~~~~~~~ +In member function 'void veryfasttree::NeighbourJoining::Profile::setVectorSize(size_t, veryfasttree::NeighbourJoining::numeric_t, bool) [with Precision = float; Operations = veryfasttree::BasicOperations]', + inlined from 'void veryfasttree::NeighbourJoining::Profile::reset() [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:175:18, + inlined from 'veryfasttree::NeighbourJoining::Profile::Profile(int64_t, int64_t) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:26:10, + inlined from 'double veryfasttree::NeighbourJoining::MLQuartetOptimize(Profile&, Profile&, Profile&, Profile&, double*, bool*, double*) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:1699:17: +/build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:104:24: warning: array subscript -1 is outside array bounds of 'void [536870911]' [-Warray-bounds=] + 104 | DynDiskMemory *disk = (DynDiskMemory * ) * (((uintptr_t *) codes) - 1); + | ^~~~ +In constructor 'veryfasttree::NeighbourJoining::Profile::Profile(int64_t, int64_t) [with Precision = float; Operations = veryfasttree::BasicOperations]', + inlined from 'double veryfasttree::NeighbourJoining::MLQuartetOptimize(Profile&, Profile&, Profile&, Profile&, double*, bool*, double*) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:1699:17: +/build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:16:13: note: at offset -4 into object of size [0, 536870911] allocated by 'operator new []' + 16 | codes = new char[nPos]; + | ^~~~~~~~~~~~~~ +In member function 'void veryfasttree::NeighbourJoining::Profile::setVectorSize(size_t, veryfasttree::NeighbourJoining::numeric_t, bool) [with Precision = float; Operations = veryfasttree::BasicOperations]', + inlined from 'void veryfasttree::NeighbourJoining::Profile::reset() [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:175:18, + inlined from 'veryfasttree::NeighbourJoining::Profile::Profile(int64_t, int64_t) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:26:10, + inlined from 'double veryfasttree::NeighbourJoining::MLQuartetOptimize(Profile&, Profile&, Profile&, Profile&, double*, bool*, double*) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:1715:17: +/build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:104:24: warning: array subscript -1 is outside array bounds of 'void [536870911]' [-Warray-bounds=] + 104 | DynDiskMemory *disk = (DynDiskMemory * ) * (((uintptr_t *) codes) - 1); + | ^~~~ +In constructor 'veryfasttree::NeighbourJoining::Profile::Profile(int64_t, int64_t) [with Precision = float; Operations = veryfasttree::BasicOperations]', + inlined from 'double veryfasttree::NeighbourJoining::MLQuartetOptimize(Profile&, Profile&, Profile&, Profile&, double*, bool*, double*) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:1715:17: +/build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:16:13: note: at offset -4 into object of size [0, 536870911] allocated by 'operator new []' + 16 | codes = new char[nPos]; + | ^~~~~~~~~~~~~~ +In member function 'void veryfasttree::NeighbourJoining::Profile::setVectorSize(size_t, veryfasttree::NeighbourJoining::numeric_t, bool) [with Precision = float; Operations = veryfasttree::BasicOperations]', + inlined from 'void veryfasttree::NeighbourJoining::Profile::reset() [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:175:18, + inlined from 'veryfasttree::NeighbourJoining::Profile::Profile(int64_t, int64_t) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:26:10, + inlined from 'double veryfasttree::NeighbourJoining::MLQuartetOptimize(Profile&, Profile&, Profile&, Profile&, double*, bool*, double*) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:1732:17: +/build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:104:24: warning: array subscript -1 is outside array bounds of 'void [536870911]' [-Warray-bounds=] + 104 | DynDiskMemory *disk = (DynDiskMemory * ) * (((uintptr_t *) codes) - 1); + | ^~~~ +In constructor 'veryfasttree::NeighbourJoining::Profile::Profile(int64_t, int64_t) [with Precision = float; Operations = veryfasttree::BasicOperations]', + inlined from 'double veryfasttree::NeighbourJoining::MLQuartetOptimize(Profile&, Profile&, Profile&, Profile&, double*, bool*, double*) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:1732:17: +/build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:16:13: note: at offset -4 into object of size [0, 536870911] allocated by 'operator new []' + 16 | codes = new char[nPos]; + | ^~~~~~~~~~~~~~ +In member function 'void veryfasttree::NeighbourJoining::Profile::setVectorSize(size_t, veryfasttree::NeighbourJoining::numeric_t, bool) [with Precision = float; Operations = veryfasttree::BasicOperations]', + inlined from 'void veryfasttree::NeighbourJoining::Profile::reset() [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:175:18, + inlined from 'veryfasttree::NeighbourJoining::Profile::Profile(int64_t, int64_t) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:26:10, + inlined from 'double veryfasttree::NeighbourJoining::MLQuartetOptimize(Profile&, Profile&, Profile&, Profile&, double*, bool*, double*) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:1748:13: +/build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:104:24: warning: array subscript -1 is outside array bounds of 'void [536870911]' [-Warray-bounds=] + 104 | DynDiskMemory *disk = (DynDiskMemory * ) * (((uintptr_t *) codes) - 1); + | ^~~~ +In constructor 'veryfasttree::NeighbourJoining::Profile::Profile(int64_t, int64_t) [with Precision = float; Operations = veryfasttree::BasicOperations]', + inlined from 'double veryfasttree::NeighbourJoining::MLQuartetOptimize(Profile&, Profile&, Profile&, Profile&, double*, bool*, double*) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:1748:13: +/build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:16:13: note: at offset -4 into object of size [0, 536870911] allocated by 'operator new []' + 16 | codes = new char[nPos]; + | ^~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]', inlined from 'veryfasttree::NeighbourJoining::Rates::Rates(int64_t, int64_t) [with Precision = double; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:182:21, inlined from 'veryfasttree::NeighbourJoining::NeighbourJoining(veryfasttree::Options&, std::ostream&, veryfasttree::ProgressReport&, std::vector >&, int64_t, std::vector >&, veryfasttree::DistanceMatrix::ALIGNMENT>&, veryfasttree::TransitionMatrix::ALIGNMENT>&, std::unique_ptr&, std::unique_ptr&) [with Precision = double; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:227:60: @@ -930,6 +1045,22 @@ /usr/include/c++/14/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::TopHitsList*, std::vector::TopHitsList, std::allocator::TopHitsList> > >' changed in GCC 7.1 137 | { return std::__do_uninit_copy(__first, __last, __result); } | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ +In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = long long int; _Alloc = std::allocator]', + inlined from 'veryfasttree::NeighbourJoining::Rates::Rates(int64_t, int64_t) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:183:23, + inlined from 'veryfasttree::NeighbourJoining::NeighbourJoining(veryfasttree::Options&, std::ostream&, veryfasttree::ProgressReport&, std::vector >&, int64_t, std::vector >&, veryfasttree::DistanceMatrix::ALIGNMENT>&, veryfasttree::TransitionMatrix::ALIGNMENT>&, std::unique_ptr&, std::unique_ptr&) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:227:60: +/usr/include/c++/14/bits/stl_vector.h:1037:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 + 1037 | _M_fill_insert(end(), __new_size - size(), __x); + | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = long long int; _Alloc = std::allocator]', + inlined from 'veryfasttree::NeighbourJoining::NeighbourJoining(veryfasttree::Options&, std::ostream&, veryfasttree::ProgressReport&, std::vector >&, int64_t, std::vector >&, veryfasttree::DistanceMatrix::ALIGNMENT>&, veryfasttree::TransitionMatrix::ALIGNMENT>&, std::unique_ptr&, std::unique_ptr&) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:255:26: +/usr/include/c++/14/bits/stl_vector.h:1037:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 + 1037 | _M_fill_insert(end(), __new_size - size(), __x); + | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = long long int; _Alloc = std::allocator]', + inlined from 'veryfasttree::NeighbourJoining::NeighbourJoining(veryfasttree::Options&, std::ostream&, veryfasttree::ProgressReport&, std::vector >&, int64_t, std::vector >&, veryfasttree::DistanceMatrix::ALIGNMENT>&, veryfasttree::TransitionMatrix::ALIGNMENT>&, std::unique_ptr&, std::unique_ptr&) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:268:18: +/usr/include/c++/14/bits/stl_vector.h:1037:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 + 1037 | _M_fill_insert(end(), __new_size - size(), __x); + | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In static member function 'static _ForwardIterator std::__uninitialized_copy<_TrivialValueTypes>::__uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator::TopHitsList*, std::vector::TopHitsList, std::allocator::TopHitsList> > >; _ForwardIterator = veryfasttree::NeighbourJoining::TopHitsList*; bool _TrivialValueTypes = false]', inlined from '_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator::TopHitsList*, vector::TopHitsList, allocator::TopHitsList> > >; _ForwardIterator = veryfasttree::NeighbourJoining::TopHitsList*]' at /usr/include/c++/14/bits/stl_uninitialized.h:185:15, inlined from '_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = __gnu_cxx::__normal_iterator::TopHitsList*, vector::TopHitsList, allocator::TopHitsList> > >; _ForwardIterator = veryfasttree::NeighbourJoining::TopHitsList*; _Tp = veryfasttree::NeighbourJoining::TopHitsList]' at /usr/include/c++/14/bits/stl_uninitialized.h:373:37, @@ -956,13 +1087,35 @@ /usr/include/c++/14/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::TopHitsList*, std::vector::TopHitsList, std::allocator::TopHitsList> > >' changed in GCC 7.1 137 | { return std::__do_uninit_copy(__first, __last, __result); } | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ -In file included from /usr/include/c++/14/vector:66: -In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = long long int; _Alloc = std::allocator]', - inlined from 'void veryfasttree::NeighbourJoining::Rates::reset(int64_t, int64_t) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:192:19, - inlined from 'void veryfasttree::NeighbourJoining::setMLRates() [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:5431:16: -/usr/include/c++/14/bits/stl_vector.h:1037:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 1037 | _M_fill_insert(end(), __new_size - size(), __x); - | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/c++/14/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_fill_insert(iterator, size_type, const value_type&) [with _Tp = veryfasttree::NeighbourJoining::Hit; _Alloc = std::allocator::Hit>]': +/usr/include/c++/14/bits/vector.tcc:700:5: note: parameter passing for argument of type 'std::vector::Hit, std::allocator::Hit> >::iterator' changed in GCC 7.1 + 700 | vector<_Tp, _Alloc>:: + | ^~~~~~~~~~~~~~~~~~~ +In file included from /usr/include/c++/14/memory:69, + from /usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:20: +/usr/include/c++/14/bits/stl_uninitialized.h: In function '_ForwardIterator std::__do_uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator::TopHitsList*, vector::TopHitsList, allocator::TopHitsList> > >; _ForwardIterator = veryfasttree::NeighbourJoining::TopHitsList*]': +/usr/include/c++/14/bits/stl_uninitialized.h:113:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::TopHitsList*, std::vector::TopHitsList, std::allocator::TopHitsList> > >' changed in GCC 7.1 + 113 | __do_uninit_copy(_InputIterator __first, _InputIterator __last, + | ^~~~~~~~~~~~~~~~ +/usr/include/c++/14/bits/stl_uninitialized.h:113:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::TopHitsList*, std::vector::TopHitsList, std::allocator::TopHitsList> > >' 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::TopHitsList*, std::vector::TopHitsList, std::allocator::TopHitsList> > >; _ForwardIterator = veryfasttree::NeighbourJoining::TopHitsList*; bool _TrivialValueTypes = false]', + inlined from '_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator::TopHitsList*, vector::TopHitsList, allocator::TopHitsList> > >; _ForwardIterator = veryfasttree::NeighbourJoining::TopHitsList*]' at /usr/include/c++/14/bits/stl_uninitialized.h:185:15, + inlined from '_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = __gnu_cxx::__normal_iterator::TopHitsList*, vector::TopHitsList, allocator::TopHitsList> > >; _ForwardIterator = veryfasttree::NeighbourJoining::TopHitsList*; _Tp = veryfasttree::NeighbourJoining::TopHitsList]' at /usr/include/c++/14/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::TopHitsList*, std::vector::TopHitsList, std::allocator::TopHitsList> > >; _Tp = veryfasttree::NeighbourJoining::TopHitsList; _Alloc = std::allocator::TopHitsList>]' at /usr/include/c++/14/bits/stl_vector.h:1624:35, + inlined from 'std::vector<_Tp, _Alloc>& std::vector<_Tp, _Alloc>::operator=(const std::vector<_Tp, _Alloc>&) [with _Tp = veryfasttree::NeighbourJoining::TopHitsList; _Alloc = std::allocator::TopHitsList>]' at /usr/include/c++/14/bits/vector.tcc:238:44: +/usr/include/c++/14/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::TopHitsList*, std::vector::TopHitsList, std::allocator::TopHitsList> > >' 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::TopHitsList*, std::vector::TopHitsList, std::allocator::TopHitsList> > >; _ForwardIterator = veryfasttree::NeighbourJoining::TopHitsList*; bool _TrivialValueTypes = false]', + inlined from '_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator::TopHitsList*, vector::TopHitsList, allocator::TopHitsList> > >; _ForwardIterator = veryfasttree::NeighbourJoining::TopHitsList*]' at /usr/include/c++/14/bits/stl_uninitialized.h:185:15, + inlined from '_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = __gnu_cxx::__normal_iterator::TopHitsList*, vector::TopHitsList, allocator::TopHitsList> > >; _ForwardIterator = veryfasttree::NeighbourJoining::TopHitsList*; _Tp = veryfasttree::NeighbourJoining::TopHitsList]' at /usr/include/c++/14/bits/stl_uninitialized.h:373:37, + inlined from 'std::vector<_Tp, _Alloc>::vector(const std::vector<_Tp, _Alloc>&) [with _Tp = veryfasttree::NeighbourJoining::TopHitsList; _Alloc = std::allocator::TopHitsList>]' at /usr/include/c++/14/bits/stl_vector.h:606:31, + inlined from 'veryfasttree::NeighbourJoining::TopHits::TopHits(const veryfasttree::NeighbourJoining::TopHits&)' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.h:224:16, + inlined from 'void std::_Construct(_Tp*, _Args&& ...) [with _Tp = veryfasttree::NeighbourJoining::TopHits; _Args = {const veryfasttree::NeighbourJoining::TopHits&}]' at /usr/include/c++/14/bits/stl_construct.h:119:7, + inlined from '_ForwardIterator std::__do_uninit_fill_n(_ForwardIterator, _Size, const _Tp&) [with _ForwardIterator = veryfasttree::NeighbourJoining::TopHits*; _Size = unsigned int; _Tp = veryfasttree::NeighbourJoining::TopHits]' at /usr/include/c++/14/bits/stl_uninitialized.h:267:21: +/usr/include/c++/14/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::TopHitsList*, std::vector::TopHitsList, std::allocator::TopHitsList> > >' changed in GCC 7.1 + 137 | { return std::__do_uninit_copy(__first, __last, __result); } + | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_fill_insert(iterator, size_type, const value_type&) [with _Tp = veryfasttree::NeighbourJoining::TopHitsList; _Alloc = std::allocator::TopHitsList>]': /usr/include/c++/14/bits/vector.tcc:700:5: note: parameter passing for argument of type 'std::vector::TopHitsList, std::allocator::TopHitsList> >::iterator' changed in GCC 7.1 700 | vector<_Tp, _Alloc>:: @@ -985,12 +1138,50 @@ /usr/include/c++/14/bits/stl_vector.h:1037:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1037 | _M_fill_insert(end(), __new_size - size(), __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/c++/14/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_fill_insert(iterator, size_type, const value_type&) [with _Tp = veryfasttree::NeighbourJoining::TopHits; _Alloc = std::allocator::TopHits>]': +/usr/include/c++/14/bits/vector.tcc:700:5: note: parameter passing for argument of type 'std::vector::TopHits, std::allocator::TopHits> >::iterator' changed in GCC 7.1 + 700 | vector<_Tp, _Alloc>:: + | ^~~~~~~~~~~~~~~~~~~ +In static member function 'static _ForwardIterator std::__uninitialized_copy<_TrivialValueTypes>::__uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator::TopHitsList*, std::vector::TopHitsList, std::allocator::TopHitsList> > >; _ForwardIterator = veryfasttree::NeighbourJoining::TopHitsList*; bool _TrivialValueTypes = false]', + inlined from '_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator::TopHitsList*, vector::TopHitsList, allocator::TopHitsList> > >; _ForwardIterator = veryfasttree::NeighbourJoining::TopHitsList*]' at /usr/include/c++/14/bits/stl_uninitialized.h:185:15, + inlined from '_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = __gnu_cxx::__normal_iterator::TopHitsList*, vector::TopHitsList, allocator::TopHitsList> > >; _ForwardIterator = veryfasttree::NeighbourJoining::TopHitsList*; _Tp = veryfasttree::NeighbourJoining::TopHitsList]' at /usr/include/c++/14/bits/stl_uninitialized.h:373:37, + inlined from 'std::vector<_Tp, _Alloc>::vector(const std::vector<_Tp, _Alloc>&) [with _Tp = veryfasttree::NeighbourJoining::TopHitsList; _Alloc = std::allocator::TopHitsList>]' at /usr/include/c++/14/bits/stl_vector.h:606:31, + inlined from 'veryfasttree::NeighbourJoining::TopHits::TopHits(const veryfasttree::NeighbourJoining::TopHits&)' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.h:224:16, + inlined from 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = veryfasttree::NeighbourJoining::TopHits; _Args = {const veryfasttree::NeighbourJoining::TopHits&}; _Tp = veryfasttree::NeighbourJoining::TopHits]' at /usr/include/c++/14/bits/new_allocator.h:191:4, + inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = veryfasttree::NeighbourJoining::TopHits; _Args = {const veryfasttree::NeighbourJoining::TopHits&}; _Tp = veryfasttree::NeighbourJoining::TopHits]' at /usr/include/c++/14/bits/alloc_traits.h:569:17, + inlined from 'std::vector<_Tp, _Alloc>::_Temporary_value::_Temporary_value(std::vector<_Tp, _Alloc>*, _Args&& ...) [with _Args = {const veryfasttree::NeighbourJoining::TopHits&}; _Tp = veryfasttree::NeighbourJoining::TopHits; _Alloc = std::allocator::TopHits>]' at /usr/include/c++/14/bits/stl_vector.h:1840:30, + inlined from 'void std::vector<_Tp, _Alloc>::_M_fill_insert(iterator, size_type, const value_type&) [with _Tp = veryfasttree::NeighbourJoining::TopHits; _Alloc = std::allocator::TopHits>]' at /usr/include/c++/14/bits/vector.tcc:711:25: +/usr/include/c++/14/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::TopHitsList*, std::vector::TopHitsList, std::allocator::TopHitsList> > >' changed in GCC 7.1 + 137 | { return std::__do_uninit_copy(__first, __last, __result); } + | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/c++/14/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_fill_insert(iterator, size_type, const value_type&) [with _Tp = veryfasttree::NeighbourJoining::TopHitsList; _Alloc = std::allocator::TopHitsList>]': +/usr/include/c++/14/bits/vector.tcc:700:5: note: parameter passing for argument of type 'std::vector::TopHitsList, std::allocator::TopHitsList> >::iterator' changed in GCC 7.1 + 700 | vector<_Tp, _Alloc>:: + | ^~~~~~~~~~~~~~~~~~~ /usr/include/boost/sort/spinsort/spinsort.hpp: In function 'void boost::sort::spin_detail::insert_partial_sort(Iter1_t, Iter1_t, Iter1_t, Compare, const boost::sort::common::range&) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]': /usr/include/boost/sort/spinsort/spinsort.hpp:86:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 86 | static void insert_partial_sort (Iter1_t first, Iter1_t mid, Iter1_t last, | ^~~~~~~~~~~~~~~~~~~ /usr/include/boost/sort/spinsort/spinsort.hpp:86:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 /usr/include/boost/sort/spinsort/spinsort.hpp:86:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 +In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = veryfasttree::NeighbourJoining::TopHitsList; _Alloc = std::allocator::TopHitsList>]', + inlined from 'veryfasttree::NeighbourJoining::TopHits::TopHits(const veryfasttree::Options&, int64_t, int64_t) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:204:24, + inlined from 'std::unique_ptr veryfasttree::make_unique2(Args&& ...) [with T = NeighbourJoining::TopHits; Args = {Options&, long long int&, long long int&}]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../Utils.h:81:35: +/usr/include/c++/14/bits/stl_vector.h:1037:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::TopHitsList*, std::vector::TopHitsList, std::allocator::TopHitsList> > >' changed in GCC 7.1 + 1037 | _M_fill_insert(end(), __new_size - size(), __x); + | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = veryfasttree::NeighbourJoining::Hit; _Alloc = std::allocator::Hit>]', + inlined from 'veryfasttree::NeighbourJoining::TopHits::TopHits(const veryfasttree::Options&, int64_t, int64_t) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:205:19, + inlined from 'std::unique_ptr veryfasttree::make_unique2(Args&& ...) [with T = NeighbourJoining::TopHits; Args = {Options&, long long int&, long long int&}]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../Utils.h:81:35: +/usr/include/c++/14/bits/stl_vector.h:1037:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Hit*, std::vector::Hit, std::allocator::Hit> > >' changed in GCC 7.1 + 1037 | _M_fill_insert(end(), __new_size - size(), __x); + | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = long long int; _Alloc = std::allocator]', + inlined from 'veryfasttree::NeighbourJoining::TopHits::TopHits(const veryfasttree::Options&, int64_t, int64_t) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:207:22, + inlined from 'std::unique_ptr veryfasttree::make_unique2(Args&& ...) [with T = NeighbourJoining::TopHits; Args = {Options&, long long int&, long long int&}]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../Utils.h:81:35: +/usr/include/c++/14/bits/stl_vector.h:1037:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 + 1037 | _M_fill_insert(end(), __new_size - size(), __x); + | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/sort/spinsort/spinsort.hpp: In function 'bool boost::sort::spin_detail::check_stable_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]': /usr/include/boost/sort/spinsort/spinsort.hpp:175:20: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 175 | insert_sort(rng_data.first, rng_data.last, comp); @@ -1022,6 +1213,12 @@ /usr/include/boost/sort/spinsort/spinsort.hpp:86:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 /usr/include/boost/sort/spinsort/spinsort.hpp:86:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 /usr/include/boost/sort/spinsort/spinsort.hpp:86:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +/usr/include/boost/sort/spinsort/spinsort.hpp: In function 'void boost::sort::spin_detail::insert_partial_sort(Iter1_t, Iter1_t, Iter1_t, Compare, const boost::sort::common::range&) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]': +/usr/include/boost/sort/spinsort/spinsort.hpp:86:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 + 86 | static void insert_partial_sort (Iter1_t first, Iter1_t mid, Iter1_t last, + | ^~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/spinsort/spinsort.hpp:86:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 +/usr/include/boost/sort/spinsort/spinsort.hpp:86:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 /usr/include/boost/sort/spinsort/spinsort.hpp: In function 'bool boost::sort::spin_detail::check_stable_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]': /usr/include/boost/sort/spinsort/spinsort.hpp:175:20: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 175 | insert_sort(rng_data.first, rng_data.last, comp); @@ -1032,6 +1229,16 @@ /usr/include/boost/sort/spinsort/spinsort.hpp:219:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 219 | insert_partial_sort(rng_data.first, it2, rng_data.last, comp, rng_aux); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/spinsort/spinsort.hpp: In function 'bool boost::sort::spin_detail::check_stable_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]': +/usr/include/boost/sort/spinsort/spinsort.hpp:175:20: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 + 175 | insert_sort(rng_data.first, rng_data.last, comp); + | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/spinsort/spinsort.hpp:195:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 + 195 | insert_partial_sort(rng_data.first, it2, rng_data.last, comp, rng_aux); + | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/spinsort/spinsort.hpp:219:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 + 219 | insert_partial_sort(rng_data.first, it2, rng_data.last, comp, rng_aux); + | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/sort/spinsort/spinsort.hpp: In function 'void boost::sort::spin_detail::range_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare, uint32_t) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]': /usr/include/boost/sort/spinsort/spinsort.hpp:284:20: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 284 | insert_sort(range_input1.first, range_input1.last, comp); @@ -1039,10 +1246,27 @@ /usr/include/boost/sort/spinsort/spinsort.hpp:285:20: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 285 | insert_sort(range_input2.first, range_input2.last, comp); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/spinsort/spinsort.hpp: In function 'void boost::sort::spin_detail::range_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare, uint32_t) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]': +/usr/include/boost/sort/spinsort/spinsort.hpp:284:20: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 + 284 | insert_sort(range_input1.first, range_input1.last, comp); + | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/spinsort/spinsort.hpp:285:20: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 + 285 | insert_sort(range_input2.first, range_input2.last, comp); + | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/spinsort/spinsort.hpp: In function 'void boost::sort::spin_detail::sort_range_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]': +/usr/include/boost/sort/spinsort/spinsort.hpp:327:20: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 + 327 | insert_sort(rng_data.first, rng_data.last, comp); + | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/sort/spinsort/spinsort.hpp: In function 'void boost::sort::spin_detail::sort_range_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]': /usr/include/boost/sort/spinsort/spinsort.hpp:327:20: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 327 | insert_sort(rng_data.first, rng_data.last, comp); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/spinsort/spinsort.hpp: In function 'void boost::sort::spin_detail::insert_partial_sort(Iter1_t, Iter1_t, Iter1_t, Compare, const boost::sort::common::range&) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = long long int*; Compare = veryfasttree::NeighbourJoining::CompareSeeds]': +/usr/include/boost/sort/spinsort/spinsort.hpp:86:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 + 86 | static void insert_partial_sort (Iter1_t first, Iter1_t mid, Iter1_t last, + | ^~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/spinsort/spinsort.hpp:86:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 +/usr/include/boost/sort/spinsort/spinsort.hpp:86:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 /usr/include/boost/sort/spinsort/spinsort.hpp: In function 'void boost::sort::spin_detail::insert_partial_sort(Iter1_t, Iter1_t, Iter1_t, Compare, const boost::sort::common::range&) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]': /usr/include/boost/sort/spinsort/spinsort.hpp:86:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 86 | static void insert_partial_sort (Iter1_t first, Iter1_t mid, Iter1_t last, @@ -1070,88 +1294,61 @@ /usr/include/boost/sort/spinsort/spinsort.hpp:285:20: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 285 | insert_sort(range_input2.first, range_input2.last, comp); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/spinsort/spinsort.hpp: In function 'void boost::sort::spin_detail::insert_partial_sort(Iter1_t, Iter1_t, Iter1_t, Compare, const boost::sort::common::range&) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]': +/usr/include/boost/sort/spinsort/spinsort.hpp:86:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +/usr/include/boost/sort/spinsort/spinsort.hpp:86:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +/usr/include/boost/sort/spinsort/spinsort.hpp:86:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 /usr/include/boost/sort/spinsort/spinsort.hpp: In function 'void boost::sort::spin_detail::sort_range_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]': /usr/include/boost/sort/spinsort/spinsort.hpp:327:20: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 327 | insert_sort(rng_data.first, rng_data.last, comp); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/spinsort/spinsort.hpp: In function 'bool boost::sort::spin_detail::check_stable_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]': +/usr/include/boost/sort/spinsort/spinsort.hpp:175:20: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 175 | insert_sort(rng_data.first, rng_data.last, comp); + | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/spinsort/spinsort.hpp:195:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 195 | insert_partial_sort(rng_data.first, it2, rng_data.last, comp, rng_aux); + | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/spinsort/spinsort.hpp:219:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 219 | insert_partial_sort(rng_data.first, it2, rng_data.last, comp, rng_aux); + | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/sort/spinsort/spinsort.hpp: In function 'void boost::sort::spin_detail::insert_partial_sort(Iter1_t, Iter1_t, Iter1_t, Compare, const boost::sort::common::range&) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]': /usr/include/boost/sort/spinsort/spinsort.hpp:86:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 86 | static void insert_partial_sort (Iter1_t first, Iter1_t mid, Iter1_t last, | ^~~~~~~~~~~~~~~~~~~ /usr/include/boost/sort/spinsort/spinsort.hpp:86:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 /usr/include/boost/sort/spinsort/spinsort.hpp:86:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -In member function 'void veryfasttree::NeighbourJoining::Profile::setVectorSize(size_t, veryfasttree::NeighbourJoining::numeric_t, bool) [with Precision = float; Operations = veryfasttree::BasicOperations]', - inlined from 'void veryfasttree::NeighbourJoining::Profile::reset() [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:175:18, - inlined from 'veryfasttree::NeighbourJoining::Profile::Profile(int64_t, int64_t) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:26:10, - inlined from 'double veryfasttree::NeighbourJoining::MLQuartetOptimize(Profile&, Profile&, Profile&, Profile&, double*, bool*, double*) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:1670:13: -/build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:104:24: warning: array subscript -1 is outside array bounds of 'void [536870911]' [-Warray-bounds=] - 104 | DynDiskMemory *disk = (DynDiskMemory * ) * (((uintptr_t *) codes) - 1); - | ^~~~ -In constructor 'veryfasttree::NeighbourJoining::Profile::Profile(int64_t, int64_t) [with Precision = float; Operations = veryfasttree::BasicOperations]', - inlined from 'double veryfasttree::NeighbourJoining::MLQuartetOptimize(Profile&, Profile&, Profile&, Profile&, double*, bool*, double*) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:1670:13: -/build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:16:13: note: at offset -4 into object of size [0, 536870911] allocated by 'operator new []' - 16 | codes = new char[nPos]; - | ^~~~~~~~~~~~~~ -In member function 'void veryfasttree::NeighbourJoining::Profile::setVectorSize(size_t, veryfasttree::NeighbourJoining::numeric_t, bool) [with Precision = float; Operations = veryfasttree::BasicOperations]', - inlined from 'void veryfasttree::NeighbourJoining::Profile::reset() [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:175:18, - inlined from 'veryfasttree::NeighbourJoining::Profile::Profile(int64_t, int64_t) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:26:10, - inlined from 'double veryfasttree::NeighbourJoining::MLQuartetOptimize(Profile&, Profile&, Profile&, Profile&, double*, bool*, double*) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:1671:13: -/build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:104:24: warning: array subscript -1 is outside array bounds of 'void [536870911]' [-Warray-bounds=] - 104 | DynDiskMemory *disk = (DynDiskMemory * ) * (((uintptr_t *) codes) - 1); - | ^~~~ -In constructor 'veryfasttree::NeighbourJoining::Profile::Profile(int64_t, int64_t) [with Precision = float; Operations = veryfasttree::BasicOperations]', - inlined from 'double veryfasttree::NeighbourJoining::MLQuartetOptimize(Profile&, Profile&, Profile&, Profile&, double*, bool*, double*) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:1671:13: -/build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:16:13: note: at offset -4 into object of size [0, 536870911] allocated by 'operator new []' - 16 | codes = new char[nPos]; - | ^~~~~~~~~~~~~~ -In member function 'void veryfasttree::NeighbourJoining::Profile::setVectorSize(size_t, veryfasttree::NeighbourJoining::numeric_t, bool) [with Precision = float; Operations = veryfasttree::BasicOperations]', - inlined from 'void veryfasttree::NeighbourJoining::Profile::reset() [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:175:18, - inlined from 'veryfasttree::NeighbourJoining::Profile::Profile(int64_t, int64_t) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:26:10, - inlined from 'double veryfasttree::NeighbourJoining::MLQuartetOptimize(Profile&, Profile&, Profile&, Profile&, double*, bool*, double*) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:1699:17: -/build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:104:24: warning: array subscript -1 is outside array bounds of 'void [536870911]' [-Warray-bounds=] - 104 | DynDiskMemory *disk = (DynDiskMemory * ) * (((uintptr_t *) codes) - 1); - | ^~~~ -In constructor 'veryfasttree::NeighbourJoining::Profile::Profile(int64_t, int64_t) [with Precision = float; Operations = veryfasttree::BasicOperations]', - inlined from 'double veryfasttree::NeighbourJoining::MLQuartetOptimize(Profile&, Profile&, Profile&, Profile&, double*, bool*, double*) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:1699:17: -/build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:16:13: note: at offset -4 into object of size [0, 536870911] allocated by 'operator new []' - 16 | codes = new char[nPos]; - | ^~~~~~~~~~~~~~ -In member function 'void veryfasttree::NeighbourJoining::Profile::setVectorSize(size_t, veryfasttree::NeighbourJoining::numeric_t, bool) [with Precision = float; Operations = veryfasttree::BasicOperations]', - inlined from 'void veryfasttree::NeighbourJoining::Profile::reset() [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:175:18, - inlined from 'veryfasttree::NeighbourJoining::Profile::Profile(int64_t, int64_t) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:26:10, - inlined from 'double veryfasttree::NeighbourJoining::MLQuartetOptimize(Profile&, Profile&, Profile&, Profile&, double*, bool*, double*) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:1715:17: -/build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:104:24: warning: array subscript -1 is outside array bounds of 'void [536870911]' [-Warray-bounds=] - 104 | DynDiskMemory *disk = (DynDiskMemory * ) * (((uintptr_t *) codes) - 1); - | ^~~~ -In constructor 'veryfasttree::NeighbourJoining::Profile::Profile(int64_t, int64_t) [with Precision = float; Operations = veryfasttree::BasicOperations]', - inlined from 'double veryfasttree::NeighbourJoining::MLQuartetOptimize(Profile&, Profile&, Profile&, Profile&, double*, bool*, double*) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:1715:17: -/build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:16:13: note: at offset -4 into object of size [0, 536870911] allocated by 'operator new []' - 16 | codes = new char[nPos]; - | ^~~~~~~~~~~~~~ -In member function 'void veryfasttree::NeighbourJoining::Profile::setVectorSize(size_t, veryfasttree::NeighbourJoining::numeric_t, bool) [with Precision = float; Operations = veryfasttree::BasicOperations]', - inlined from 'void veryfasttree::NeighbourJoining::Profile::reset() [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:175:18, - inlined from 'veryfasttree::NeighbourJoining::Profile::Profile(int64_t, int64_t) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:26:10, - inlined from 'double veryfasttree::NeighbourJoining::MLQuartetOptimize(Profile&, Profile&, Profile&, Profile&, double*, bool*, double*) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:1732:17: -/build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:104:24: warning: array subscript -1 is outside array bounds of 'void [536870911]' [-Warray-bounds=] - 104 | DynDiskMemory *disk = (DynDiskMemory * ) * (((uintptr_t *) codes) - 1); - | ^~~~ -In constructor 'veryfasttree::NeighbourJoining::Profile::Profile(int64_t, int64_t) [with Precision = float; Operations = veryfasttree::BasicOperations]', - inlined from 'double veryfasttree::NeighbourJoining::MLQuartetOptimize(Profile&, Profile&, Profile&, Profile&, double*, bool*, double*) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:1732:17: -/build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:16:13: note: at offset -4 into object of size [0, 536870911] allocated by 'operator new []' - 16 | codes = new char[nPos]; - | ^~~~~~~~~~~~~~ -In member function 'void veryfasttree::NeighbourJoining::Profile::setVectorSize(size_t, veryfasttree::NeighbourJoining::numeric_t, bool) [with Precision = float; Operations = veryfasttree::BasicOperations]', - inlined from 'void veryfasttree::NeighbourJoining::Profile::reset() [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:175:18, - inlined from 'veryfasttree::NeighbourJoining::Profile::Profile(int64_t, int64_t) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:26:10, - inlined from 'double veryfasttree::NeighbourJoining::MLQuartetOptimize(Profile&, Profile&, Profile&, Profile&, double*, bool*, double*) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:1748:13: -/build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:104:24: warning: array subscript -1 is outside array bounds of 'void [536870911]' [-Warray-bounds=] - 104 | DynDiskMemory *disk = (DynDiskMemory * ) * (((uintptr_t *) codes) - 1); - | ^~~~ -In constructor 'veryfasttree::NeighbourJoining::Profile::Profile(int64_t, int64_t) [with Precision = float; Operations = veryfasttree::BasicOperations]', - inlined from 'double veryfasttree::NeighbourJoining::MLQuartetOptimize(Profile&, Profile&, Profile&, Profile&, double*, bool*, double*) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:1748:13: -/build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:16:13: note: at offset -4 into object of size [0, 536870911] allocated by 'operator new []' - 16 | codes = new char[nPos]; - | ^~~~~~~~~~~~~~ +/usr/include/boost/sort/spinsort/spinsort.hpp: In function 'void boost::sort::spin_detail::range_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare, uint32_t) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]': +/usr/include/boost/sort/spinsort/spinsort.hpp:284:20: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 284 | insert_sort(range_input1.first, range_input1.last, comp); + | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/spinsort/spinsort.hpp:285:20: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 285 | insert_sort(range_input2.first, range_input2.last, comp); + | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/spinsort/spinsort.hpp: In function 'void boost::sort::spin_detail::sort_range_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]': +/usr/include/boost/sort/spinsort/spinsort.hpp:327:20: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 327 | insert_sort(rng_data.first, rng_data.last, comp); + | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/spinsort/spinsort.hpp: In function 'void boost::sort::spin_detail::insert_partial_sort(Iter1_t, Iter1_t, Iter1_t, Compare, const boost::sort::common::range&) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]': +/usr/include/boost/sort/spinsort/spinsort.hpp:86:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 86 | static void insert_partial_sort (Iter1_t first, Iter1_t mid, Iter1_t last, + | ^~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/spinsort/spinsort.hpp:86:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +/usr/include/boost/sort/spinsort/spinsort.hpp:86:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +/usr/include/boost/sort/spinsort/spinsort.hpp: In function 'void boost::sort::spin_detail::insert_partial_sort(Iter1_t, Iter1_t, Iter1_t, Compare, const boost::sort::common::range&) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]': +/usr/include/boost/sort/spinsort/spinsort.hpp:86:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +/usr/include/boost/sort/spinsort/spinsort.hpp:86:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +/usr/include/boost/sort/spinsort/spinsort.hpp:86:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +/usr/include/boost/sort/spinsort/spinsort.hpp: In function 'bool boost::sort::spin_detail::check_stable_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]': +/usr/include/boost/sort/spinsort/spinsort.hpp:175:20: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 175 | insert_sort(rng_data.first, rng_data.last, comp); + | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/spinsort/spinsort.hpp:195:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 195 | insert_partial_sort(rng_data.first, it2, rng_data.last, comp, rng_aux); + | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/spinsort/spinsort.hpp:219:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 219 | insert_partial_sort(rng_data.first, it2, rng_data.last, comp, rng_aux); + | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'boost::sort::common::range boost::sort::common::merge_construct(const range&, const range&, const range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = __gnu_cxx::__normal_iterator >; Value_t = long long int; Compare = veryfasttree::NeighbourJoining::CompareSeeds]', inlined from 'boost::sort::common::range boost::sort::common::uninit_full_merge4(const range&, range*, uint32_t, Compare) [with Value_t = long long int; Iter_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]' at /usr/include/boost/sort/common/merge_four.hpp:236:31: /usr/include/boost/sort/common/range.hpp:284:46: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 @@ -1176,6 +1373,23 @@ 285 | src2.last, dest.first, comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/sort/common/range.hpp:284:46: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 +/usr/include/boost/sort/spinsort/spinsort.hpp: In function 'void boost::sort::spin_detail::range_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare, uint32_t) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]': +/usr/include/boost/sort/spinsort/spinsort.hpp:284:20: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 284 | insert_sort(range_input1.first, range_input1.last, comp); + | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/spinsort/spinsort.hpp:285:20: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 285 | insert_sort(range_input2.first, range_input2.last, comp); + | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/spinsort/spinsort.hpp: In function 'void boost::sort::spin_detail::sort_range_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]': +/usr/include/boost/sort/spinsort/spinsort.hpp:327:20: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 327 | insert_sort(rng_data.first, rng_data.last, comp); + | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/spinsort/spinsort.hpp: In function 'void boost::sort::spin_detail::insert_partial_sort(Iter1_t, Iter1_t, Iter1_t, Compare, const boost::sort::common::range&) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]': +/usr/include/boost/sort/spinsort/spinsort.hpp:86:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 86 | static void insert_partial_sort (Iter1_t first, Iter1_t mid, Iter1_t last, + | ^~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/spinsort/spinsort.hpp:86:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +/usr/include/boost/sort/spinsort/spinsort.hpp:86:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 /usr/include/boost/sort/spinsort/spinsort.hpp: In function 'void boost::sort::spin_detail::range_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare, uint32_t) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = long long int*; Compare = veryfasttree::NeighbourJoining::CompareSeeds]': /usr/include/boost/sort/spinsort/spinsort.hpp:284:20: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 284 | insert_sort(range_input1.first, range_input1.last, comp); @@ -1212,6 +1426,30 @@ | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 260 | dest.first, comp); | ~~~~~~~~~~~~~~~~~ +In function 'boost::sort::common::range boost::sort::common::merge_construct(const range&, const range&, const range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = __gnu_cxx::__normal_iterator >; Value_t = long long int; Compare = veryfasttree::NeighbourJoining::CompareSeeds]', + inlined from 'boost::sort::common::range boost::sort::common::uninit_full_merge4(const range&, range*, uint32_t, Compare) [with Value_t = long long int; Iter_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]' at /usr/include/boost/sort/common/merge_four.hpp:236:31: +/usr/include/boost/sort/common/range.hpp:284:46: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 + 284 | Value_t * ptr_aux = util::merge_construct(src1.first, src1.last, src2.first, + | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ + 285 | src2.last, dest.first, comp); + | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/common/range.hpp:284:46: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 +In function 'boost::sort::common::range boost::sort::common::merge_construct(const range&, const range&, const range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = __gnu_cxx::__normal_iterator >; Value_t = long long int; Compare = veryfasttree::NeighbourJoining::CompareSeeds]', + inlined from 'boost::sort::common::range boost::sort::common::uninit_full_merge4(const range&, range*, uint32_t, Compare) [with Value_t = long long int; Iter_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]' at /usr/include/boost/sort/common/merge_four.hpp:312:38: +/usr/include/boost/sort/common/range.hpp:284:46: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 + 284 | Value_t * ptr_aux = util::merge_construct(src1.first, src1.last, src2.first, + | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ + 285 | src2.last, dest.first, comp); + | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/common/range.hpp:284:46: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 +In function 'boost::sort::common::range boost::sort::common::merge_construct(const range&, const range&, const range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = __gnu_cxx::__normal_iterator >; Value_t = long long int; Compare = veryfasttree::NeighbourJoining::CompareSeeds]', + inlined from 'boost::sort::common::range boost::sort::common::uninit_full_merge4(const range&, range*, uint32_t, Compare) [with Value_t = long long int; Iter_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]' at /usr/include/boost/sort/common/merge_four.hpp:318:38: +/usr/include/boost/sort/common/range.hpp:284:46: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 + 284 | Value_t * ptr_aux = util::merge_construct(src1.first, src1.last, src2.first, + | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ + 285 | src2.last, dest.first, comp); + | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/common/range.hpp:284:46: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 /usr/include/boost/sort/spinsort/spinsort.hpp: In constructor 'boost::sort::spin_detail::spinsort::spinsort(Iter_t, Iter_t, Compare, value_t*, size_t) [with Iter_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]': /usr/include/boost/sort/spinsort/spinsort.hpp:441:1: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 441 | spinsort @@ -1249,6 +1487,21 @@ /usr/include/boost/sort/spinsort/spinsort.hpp:406:68: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 406 | : spinsort(first, last, comp, range_aux.first, range_aux.size()) { }; | ^ +/usr/include/boost/sort/spinsort/spinsort.hpp: In function 'void boost::sort::spin_detail::range_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare, uint32_t) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = long long int*; Compare = veryfasttree::NeighbourJoining::CompareSeeds]': +/usr/include/boost/sort/spinsort/spinsort.hpp:284:20: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 + 284 | insert_sort(range_input1.first, range_input1.last, comp); + | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/spinsort/spinsort.hpp:285:20: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 + 285 | insert_sort(range_input2.first, range_input2.last, comp); + | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = __gnu_cxx::__normal_iterator >; Iter3_t = long long int*; Compare = veryfasttree::NeighbourJoining::CompareSeeds]', + inlined from 'void boost::sort::spin_detail::range_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare, uint32_t) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = long long int*; Compare = veryfasttree::NeighbourJoining::CompareSeeds]' at /usr/include/boost/sort/spinsort/spinsort.hpp:296:10: +/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 + 259 | Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, + | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ + 260 | dest.first, comp); + | ~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = __gnu_cxx::__normal_iterator >; Iter3_t = long long int*; Compare = veryfasttree::NeighbourJoining::CompareSeeds]', inlined from 'boost::sort::common::range boost::sort::common::full_merge4(const range&, range*, uint32_t, Compare) [with Iter1_t = long long int*; Iter2_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]' at /usr/include/boost/sort/common/merge_four.hpp:107:21: /usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 @@ -1273,6 +1526,51 @@ 260 | dest.first, comp); | ~~~~~~~~~~~~~~~~~ /usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 +/usr/include/boost/sort/spinsort/spinsort.hpp: In function 'void boost::sort::spin_detail::sort_range_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = long long int*; Compare = veryfasttree::NeighbourJoining::CompareSeeds]': +/usr/include/boost/sort/spinsort/spinsort.hpp:327:20: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 + 327 | insert_sort(rng_data.first, rng_data.last, comp); + | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/spinsort/spinsort.hpp: In function 'bool boost::sort::spin_detail::check_stable_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = long long int*; Compare = veryfasttree::NeighbourJoining::CompareSeeds]': +/usr/include/boost/sort/spinsort/spinsort.hpp:175:20: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 + 175 | insert_sort(rng_data.first, rng_data.last, comp); + | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/spinsort/spinsort.hpp:195:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 + 195 | insert_partial_sort(rng_data.first, it2, rng_data.last, comp, rng_aux); + | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/spinsort/spinsort.hpp:219:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 + 219 | insert_partial_sort(rng_data.first, it2, rng_data.last, comp, rng_aux); + | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = long long int*; Iter2_t = long long int*; Iter3_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]', + inlined from 'void boost::sort::spin_detail::range_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare, uint32_t) [with Iter1_t = long long int*; Iter2_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]' at /usr/include/boost/sort/spinsort/spinsort.hpp:296:10: +/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 + 259 | Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, + | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ + 260 | dest.first, comp); + | ~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/spinsort/spinsort.hpp: In constructor 'boost::sort::spin_detail::spinsort::spinsort(Iter_t, Iter_t, Compare, value_t*, size_t) [with Iter_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]': +/usr/include/boost/sort/spinsort/spinsort.hpp:441:1: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 + 441 | spinsort + | ^~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/spinsort/spinsort.hpp:441:1: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 +/usr/include/boost/sort/spinsort/spinsort.hpp:457:20: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 + 457 | insert_sort(range_input.first, range_input.last, comp); + | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +In function 'boost::sort::common::range boost::sort::common::merge_half(const range&, const range&, const range&, Compare) [with Iter1_t = long long int*; Iter2_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]', + inlined from 'boost::sort::spin_detail::spinsort::spinsort(Iter_t, Iter_t, Compare, value_t*, size_t) [with Iter_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]' at /usr/include/boost/sort/spinsort/spinsort.hpp:512:19: +/usr/include/boost/sort/common/range.hpp:307:38: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 + 307 | Iter2_t it_aux = util::merge_half(src1.first, src1.last, src2.first, + | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ + 308 | src2.last, dest.first, comp); + | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/common/range.hpp:307:38: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 +In function 'boost::sort::common::range boost::sort::common::merge_half(const range&, const range&, const range&, Compare) [with Iter1_t = long long int*; Iter2_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]', + inlined from 'boost::sort::spin_detail::spinsort::spinsort(Iter_t, Iter_t, Compare, value_t*, size_t) [with Iter_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]' at /usr/include/boost/sort/spinsort/spinsort.hpp:530:19: +/usr/include/boost/sort/common/range.hpp:307:38: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 + 307 | Iter2_t it_aux = util::merge_half(src1.first, src1.last, src2.first, + | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ + 308 | src2.last, dest.first, comp); + | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/common/range.hpp:307:38: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = long long int*; Iter2_t = long long int*; Iter3_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]', inlined from 'boost::sort::common::range boost::sort::common::full_merge4(const range&, range*, uint32_t, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = long long int*; Compare = veryfasttree::NeighbourJoining::CompareSeeds]' at /usr/include/boost/sort/common/merge_four.hpp:107:21: /usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 @@ -1294,6 +1592,64 @@ | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 260 | dest.first, comp); | ~~~~~~~~~~~~~~~~~ +In constructor 'boost::sort::spin_detail::spinsort::spinsort(Iter_t, Iter_t, Compare, range_buf) [with Iter_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]', + inlined from 'boost::sort::sample_detail::sample_sort<__gnu_cxx::__normal_iterator >, veryfasttree::NeighbourJoining::CompareSeeds>::initial_configuration()::' at /usr/include/boost/sort/sample_sort/sample_sort.hpp:378:18, + inlined from 'constexpr _Res std::__invoke_impl(__invoke_other, _Fn&&, _Args&& ...) [with _Res = void; _Fn = boost::sort::sample_detail::sample_sort<__gnu_cxx::__normal_iterator >, veryfasttree::NeighbourJoining::CompareSeeds>::initial_configuration()::; _Args = {}]' at /usr/include/c++/14/bits/invoke.h:61:36, + inlined from 'constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = boost::sort::sample_detail::sample_sort<__gnu_cxx::__normal_iterator >, veryfasttree::NeighbourJoining::CompareSeeds>::initial_configuration()::; _Args = {}]' at /usr/include/c++/14/bits/invoke.h:96:40, + inlined from 'typename std::thread::_Invoker<_Tuple>::__result<_Tuple>::type std::thread::_Invoker<_Tuple>::_M_invoke(std::_Index_tuple<_Ind ...>) [with unsigned int ..._Ind = {0}; _Tuple = std::tuple >, veryfasttree::NeighbourJoining::CompareSeeds>::initial_configuration():: >]' at /usr/include/c++/14/bits/std_thread.h:301:26, + inlined from 'typename std::thread::_Invoker<_Tuple>::__result<_Tuple>::type std::thread::_Invoker<_Tuple>::operator()() [with _Tuple = std::tuple >, veryfasttree::NeighbourJoining::CompareSeeds>::initial_configuration():: >]' at /usr/include/c++/14/bits/std_thread.h:308:20, + inlined from '_Ptr_type std::__future_base::_Task_setter<_Ptr_type, _Fn, void>::operator()() const [with _Ptr_type = std::unique_ptr, std::__future_base::_Result_base::_Deleter>; _Fn = std::thread::_Invoker >, veryfasttree::NeighbourJoining::CompareSeeds>::initial_configuration():: > >]' at /usr/include/c++/14/future:1439:14, + inlined from 'constexpr _Res std::__invoke_impl(__invoke_other, _Fn&&, _Args&& ...) [with _Res = unique_ptr<__future_base::_Result, __future_base::_Result_base::_Deleter>; _Fn = __future_base::_Task_setter, __future_base::_Result_base::_Deleter>, thread::_Invoker >, veryfasttree::NeighbourJoining::CompareSeeds>::initial_configuration():: > >, void>&; _Args = {}]' at /usr/include/c++/14/bits/invoke.h:61:67, + inlined from 'constexpr std::__enable_if_t<((bool)(! std::is_void< >::value)), _Res> std::__invoke_r(_Callable&&, _Args&& ...) [with _Res = unique_ptr<__future_base::_Result_base, __future_base::_Result_base::_Deleter>; _Callable = __future_base::_Task_setter, __future_base::_Result_base::_Deleter>, thread::_Invoker >, veryfasttree::NeighbourJoining::CompareSeeds>::initial_configuration():: > >, void>&; _Args = {}]' at /usr/include/c++/14/bits/invoke.h:138:40, + inlined from 'static _Res std::_Function_handler<_Res(_ArgTypes ...), _Functor>::_M_invoke(const std::_Any_data&, _ArgTypes&& ...) [with _Res = std::unique_ptr; _Functor = std::__future_base::_Task_setter, std::__future_base::_Result_base::_Deleter>, std::thread::_Invoker >, veryfasttree::NeighbourJoining::CompareSeeds>::initial_configuration():: > >, void>; _ArgTypes = {}]' at /usr/include/c++/14/bits/std_function.h:291:44: +/usr/include/boost/sort/spinsort/spinsort.hpp:406:68: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 + 406 | : spinsort(first, last, comp, range_aux.first, range_aux.size()) { }; + | ^ +In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = __gnu_cxx::__normal_iterator >; Iter3_t = long long int*; Compare = veryfasttree::NeighbourJoining::CompareSeeds]', + inlined from 'boost::sort::common::range boost::sort::common::full_merge4(const range&, range*, uint32_t, Compare) [with Iter1_t = long long int*; Iter2_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]' at /usr/include/boost/sort/common/merge_four.hpp:107:21: +/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 + 259 | Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, + | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ + 260 | dest.first, comp); + | ~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 +In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = __gnu_cxx::__normal_iterator >; Iter3_t = long long int*; Compare = veryfasttree::NeighbourJoining::CompareSeeds]', + inlined from 'boost::sort::common::range boost::sort::common::full_merge4(const range&, range*, uint32_t, Compare) [with Iter1_t = long long int*; Iter2_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]' at /usr/include/boost/sort/common/merge_four.hpp:184:34: +/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 + 259 | Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, + | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ + 260 | dest.first, comp); + | ~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 +In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = __gnu_cxx::__normal_iterator >; Iter3_t = long long int*; Compare = veryfasttree::NeighbourJoining::CompareSeeds]', + inlined from 'boost::sort::common::range boost::sort::common::full_merge4(const range&, range*, uint32_t, Compare) [with Iter1_t = long long int*; Iter2_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]' at /usr/include/boost/sort/common/merge_four.hpp:189:36: +/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 + 259 | Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, + | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ + 260 | dest.first, comp); + | ~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 +In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = long long int*; Iter2_t = long long int*; Iter3_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]', + inlined from 'boost::sort::common::range boost::sort::common::full_merge4(const range&, range*, uint32_t, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = long long int*; Compare = veryfasttree::NeighbourJoining::CompareSeeds]' at /usr/include/boost/sort/common/merge_four.hpp:107:21: +/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 + 259 | Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, + | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ + 260 | dest.first, comp); + | ~~~~~~~~~~~~~~~~~ +In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = long long int*; Iter2_t = long long int*; Iter3_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]', + inlined from 'boost::sort::common::range boost::sort::common::full_merge4(const range&, range*, uint32_t, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = long long int*; Compare = veryfasttree::NeighbourJoining::CompareSeeds]' at /usr/include/boost/sort/common/merge_four.hpp:184:34: +/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 + 259 | Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, + | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ + 260 | dest.first, comp); + | ~~~~~~~~~~~~~~~~~ +In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = long long int*; Iter2_t = long long int*; Iter3_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]', + inlined from 'boost::sort::common::range boost::sort::common::full_merge4(const range&, range*, uint32_t, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = long long int*; Compare = veryfasttree::NeighbourJoining::CompareSeeds]' at /usr/include/boost/sort/common/merge_four.hpp:189:36: +/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 + 259 | Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, + | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ + 260 | dest.first, comp); + | ~~~~~~~~~~~~~~~~~ In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Iter3_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]', inlined from 'void boost::sort::spin_detail::range_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare, uint32_t) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/spinsort/spinsort.hpp:296:10: /usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 @@ -1367,6 +1723,17 @@ /usr/include/boost/sort/spinsort/spinsort.hpp:406:68: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 406 | : spinsort(first, last, comp, range_aux.first, range_aux.size()) { }; | ^ +In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Iter3_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]', + inlined from 'void boost::sort::spin_detail::range_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare, uint32_t) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/spinsort/spinsort.hpp:296:10: +/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 259 | Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, + | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ + 260 | dest.first, comp); + | ~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/spinsort/spinsort.hpp: In function 'void boost::sort::spin_detail::sort_range_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]': +/usr/include/boost/sort/spinsort/spinsort.hpp:327:20: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 327 | insert_sort(rng_data.first, rng_data.last, comp); + | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Iter3_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]', inlined from 'void boost::sort::spin_detail::range_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare, uint32_t) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/spinsort/spinsort.hpp:296:10: /usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 @@ -1374,6 +1741,16 @@ | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 260 | dest.first, comp); | ~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/spinsort/spinsort.hpp: In function 'bool boost::sort::spin_detail::check_stable_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]': +/usr/include/boost/sort/spinsort/spinsort.hpp:175:20: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 175 | insert_sort(rng_data.first, rng_data.last, comp); + | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/spinsort/spinsort.hpp:195:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 195 | insert_partial_sort(rng_data.first, it2, rng_data.last, comp, rng_aux); + | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/spinsort/spinsort.hpp:219:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 219 | insert_partial_sort(rng_data.first, it2, rng_data.last, comp, rng_aux); + | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/sort/spinsort/spinsort.hpp: In function 'void boost::sort::spin_detail::sort_range_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]': /usr/include/boost/sort/spinsort/spinsort.hpp:327:20: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 327 | insert_sort(rng_data.first, rng_data.last, comp); @@ -1388,6 +1765,21 @@ /usr/include/boost/sort/spinsort/spinsort.hpp:219:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 219 | insert_partial_sort(rng_data.first, it2, rng_data.last, comp, rng_aux); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/spinsort/spinsort.hpp: In function 'void boost::sort::spin_detail::range_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare, uint32_t) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]': +/usr/include/boost/sort/spinsort/spinsort.hpp:284:20: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 284 | insert_sort(range_input1.first, range_input1.last, comp); + | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/spinsort/spinsort.hpp:285:20: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 285 | insert_sort(range_input2.first, range_input2.last, comp); + | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter3_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]', + inlined from 'void boost::sort::spin_detail::range_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare, uint32_t) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/spinsort/spinsort.hpp:296:10: +/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 259 | Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, + | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ + 260 | dest.first, comp); + | ~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 /usr/include/boost/sort/spinsort/spinsort.hpp: In function 'void boost::sort::spin_detail::range_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare, uint32_t) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]': /usr/include/boost/sort/spinsort/spinsort.hpp:284:20: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 284 | insert_sort(range_input1.first, range_input1.last, comp); @@ -1403,6 +1795,30 @@ 260 | dest.first, comp); | ~~~~~~~~~~~~~~~~~ /usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +/usr/include/boost/sort/spinsort/spinsort.hpp: In constructor 'boost::sort::spin_detail::spinsort::spinsort(Iter_t, Iter_t, Compare, value_t*, size_t) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]': +/usr/include/boost/sort/spinsort/spinsort.hpp:441:1: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 441 | spinsort + | ^~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/spinsort/spinsort.hpp:441:1: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +/usr/include/boost/sort/spinsort/spinsort.hpp:457:20: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 457 | insert_sort(range_input.first, range_input.last, comp); + | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +In function 'boost::sort::common::range boost::sort::common::merge_half(const range&, const range&, const range&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]', + inlined from 'boost::sort::spin_detail::spinsort::spinsort(Iter_t, Iter_t, Compare, value_t*, size_t) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/spinsort/spinsort.hpp:512:19: +/usr/include/boost/sort/common/range.hpp:307:38: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 307 | Iter2_t it_aux = util::merge_half(src1.first, src1.last, src2.first, + | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ + 308 | src2.last, dest.first, comp); + | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/common/range.hpp:307:38: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +In function 'boost::sort::common::range boost::sort::common::merge_half(const range&, const range&, const range&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]', + inlined from 'boost::sort::spin_detail::spinsort::spinsort(Iter_t, Iter_t, Compare, value_t*, size_t) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/spinsort/spinsort.hpp:530:19: +/usr/include/boost/sort/common/range.hpp:307:38: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 307 | Iter2_t it_aux = util::merge_half(src1.first, src1.last, src2.first, + | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ + 308 | src2.last, dest.first, comp); + | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/common/range.hpp:307:38: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 /usr/include/boost/sort/spinsort/spinsort.hpp: In constructor 'boost::sort::spin_detail::spinsort::spinsort(Iter_t, Iter_t, Compare, value_t*, size_t) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]': /usr/include/boost/sort/spinsort/spinsort.hpp:441:1: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 441 | spinsort @@ -1427,6 +1843,19 @@ 308 | src2.last, dest.first, comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/sort/common/range.hpp:307:38: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +In constructor 'boost::sort::spin_detail::spinsort::spinsort(Iter_t, Iter_t, Compare, range_buf) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]', + inlined from 'boost::sort::sample_detail::sample_sort<__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >, veryfasttree::NeighbourJoining::CompareHitsByIJ>::initial_configuration()::' at /usr/include/boost/sort/sample_sort/sample_sort.hpp:378:18, + inlined from 'constexpr _Res std::__invoke_impl(__invoke_other, _Fn&&, _Args&& ...) [with _Res = void; _Fn = boost::sort::sample_detail::sample_sort<__gnu_cxx::__normal_iterator::Besthit*, vector::Besthit, allocator::Besthit> > >, veryfasttree::NeighbourJoining::CompareHitsByIJ>::initial_configuration()::; _Args = {}]' at /usr/include/c++/14/bits/invoke.h:61:36, + inlined from 'constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = boost::sort::sample_detail::sample_sort<__gnu_cxx::__normal_iterator::Besthit*, vector::Besthit, allocator::Besthit> > >, veryfasttree::NeighbourJoining::CompareHitsByIJ>::initial_configuration()::; _Args = {}]' at /usr/include/c++/14/bits/invoke.h:96:40, + inlined from 'typename std::thread::_Invoker<_Tuple>::__result<_Tuple>::type std::thread::_Invoker<_Tuple>::_M_invoke(std::_Index_tuple<_Ind ...>) [with unsigned int ..._Ind = {0}; _Tuple = std::tuple::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >, veryfasttree::NeighbourJoining::CompareHitsByIJ>::initial_configuration():: >]' at /usr/include/c++/14/bits/std_thread.h:301:26, + inlined from 'typename std::thread::_Invoker<_Tuple>::__result<_Tuple>::type std::thread::_Invoker<_Tuple>::operator()() [with _Tuple = std::tuple::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >, veryfasttree::NeighbourJoining::CompareHitsByIJ>::initial_configuration():: >]' at /usr/include/c++/14/bits/std_thread.h:308:20, + inlined from '_Ptr_type std::__future_base::_Task_setter<_Ptr_type, _Fn, void>::operator()() const [with _Ptr_type = std::unique_ptr, std::__future_base::_Result_base::_Deleter>; _Fn = std::thread::_Invoker::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >, veryfasttree::NeighbourJoining::CompareHitsByIJ>::initial_configuration():: > >]' at /usr/include/c++/14/future:1439:14, + inlined from 'constexpr _Res std::__invoke_impl(__invoke_other, _Fn&&, _Args&& ...) [with _Res = unique_ptr<__future_base::_Result, __future_base::_Result_base::_Deleter>; _Fn = __future_base::_Task_setter, __future_base::_Result_base::_Deleter>, thread::_Invoker::Besthit*, vector::Besthit, allocator::Besthit> > >, veryfasttree::NeighbourJoining::CompareHitsByIJ>::initial_configuration():: > >, void>&; _Args = {}]' at /usr/include/c++/14/bits/invoke.h:61:67, + inlined from 'constexpr std::__enable_if_t<((bool)(! std::is_void< >::value)), _Res> std::__invoke_r(_Callable&&, _Args&& ...) [with _Res = unique_ptr<__future_base::_Result_base, __future_base::_Result_base::_Deleter>; _Callable = __future_base::_Task_setter, __future_base::_Result_base::_Deleter>, thread::_Invoker::Besthit*, vector::Besthit, allocator::Besthit> > >, veryfasttree::NeighbourJoining::CompareHitsByIJ>::initial_configuration():: > >, void>&; _Args = {}]' at /usr/include/c++/14/bits/invoke.h:138:40, + inlined from 'static _Res std::_Function_handler<_Res(_ArgTypes ...), _Functor>::_M_invoke(const std::_Any_data&, _ArgTypes&& ...) [with _Res = std::unique_ptr; _Functor = std::__future_base::_Task_setter, std::__future_base::_Result_base::_Deleter>, std::thread::_Invoker::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >, veryfasttree::NeighbourJoining::CompareHitsByIJ>::initial_configuration():: > >, void>; _ArgTypes = {}]' at /usr/include/c++/14/bits/std_function.h:291:44: +/usr/include/boost/sort/spinsort/spinsort.hpp:406:68: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 406 | : spinsort(first, last, comp, range_aux.first, range_aux.size()) { }; + | ^ In constructor 'boost::sort::spin_detail::spinsort::spinsort(Iter_t, Iter_t, Compare, range_buf) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]', inlined from 'boost::sort::sample_detail::sample_sort<__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >, veryfasttree::NeighbourJoining::CompareHitsByCriterion>::initial_configuration()::' at /usr/include/boost/sort/sample_sort/sample_sort.hpp:378:18, inlined from 'constexpr _Res std::__invoke_impl(__invoke_other, _Fn&&, _Args&& ...) [with _Res = void; _Fn = boost::sort::sample_detail::sample_sort<__gnu_cxx::__normal_iterator::Besthit*, vector::Besthit, allocator::Besthit> > >, veryfasttree::NeighbourJoining::CompareHitsByCriterion>::initial_configuration()::; _Args = {}]' at /usr/include/c++/14/bits/invoke.h:61:36, @@ -1440,6 +1869,13 @@ /usr/include/boost/sort/spinsort/spinsort.hpp:406:68: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 406 | : spinsort(first, last, comp, range_aux.first, range_aux.size()) { }; | ^ +In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Iter3_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]', + inlined from 'void boost::sort::spin_detail::range_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare, uint32_t) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/spinsort/spinsort.hpp:296:10: +/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 259 | Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, + | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ + 260 | dest.first, comp); + | ~~~~~~~~~~~~~~~~~ In function 'boost::sort::common::range boost::sort::common::merge_construct(const range&, const range&, const range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Value_t = veryfasttree::NeighbourJoining::Besthit; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]', inlined from 'boost::sort::common::range boost::sort::common::uninit_full_merge4(const range&, range*, uint32_t, Compare) [with Value_t = veryfasttree::NeighbourJoining::Besthit; Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/common/merge_four.hpp:236:31, inlined from 'void boost::sort::common::uninit_merge_level4(range, std::vector >&, std::vector >&, Compare) [with Value_t = veryfasttree::NeighbourJoining::Besthit; Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/common/merge_vector.hpp:125:41, @@ -1470,622 +1906,6 @@ 285 | src2.last, dest.first, comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/sort/common/range.hpp:284:46: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -In function 'boost::sort::common::range boost::sort::common::merge_construct(const range&, const range&, const range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Value_t = veryfasttree::NeighbourJoining::Besthit; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]', - inlined from 'boost::sort::common::range boost::sort::common::uninit_full_merge4(const range&, range*, uint32_t, Compare) [with Value_t = veryfasttree::NeighbourJoining::Besthit; Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_four.hpp:236:31, - inlined from 'void boost::sort::common::uninit_merge_level4(range, std::vector >&, std::vector >&, Compare) [with Value_t = veryfasttree::NeighbourJoining::Besthit; Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_vector.hpp:125:41, - inlined from 'void boost::sort::sample_detail::sample_sort::execute_first() [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/sample_sort/sample_sort.hpp:162:32: -/usr/include/boost/sort/common/range.hpp:284:46: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 284 | Value_t * ptr_aux = util::merge_construct(src1.first, src1.last, src2.first, - | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - 285 | src2.last, dest.first, comp); - | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/common/range.hpp:284:46: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -In function 'boost::sort::common::range boost::sort::common::merge_construct(const range&, const range&, const range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Value_t = veryfasttree::NeighbourJoining::Besthit; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]', - inlined from 'boost::sort::common::range boost::sort::common::uninit_full_merge4(const range&, range*, uint32_t, Compare) [with Value_t = veryfasttree::NeighbourJoining::Besthit; Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_four.hpp:312:38, - inlined from 'void boost::sort::common::uninit_merge_level4(range, std::vector >&, std::vector >&, Compare) [with Value_t = veryfasttree::NeighbourJoining::Besthit; Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_vector.hpp:125:41, - inlined from 'void boost::sort::sample_detail::sample_sort::execute_first() [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/sample_sort/sample_sort.hpp:162:32: -/usr/include/boost/sort/common/range.hpp:284:46: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 284 | Value_t * ptr_aux = util::merge_construct(src1.first, src1.last, src2.first, - | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - 285 | src2.last, dest.first, comp); - | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/common/range.hpp:284:46: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -In function 'boost::sort::common::range boost::sort::common::merge_construct(const range&, const range&, const range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Value_t = veryfasttree::NeighbourJoining::Besthit; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]', - inlined from 'boost::sort::common::range boost::sort::common::uninit_full_merge4(const range&, range*, uint32_t, Compare) [with Value_t = veryfasttree::NeighbourJoining::Besthit; Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_four.hpp:318:38, - inlined from 'void boost::sort::common::uninit_merge_level4(range, std::vector >&, std::vector >&, Compare) [with Value_t = veryfasttree::NeighbourJoining::Besthit; Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_vector.hpp:125:41, - inlined from 'void boost::sort::sample_detail::sample_sort::execute_first() [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/sample_sort/sample_sort.hpp:162:32: -/usr/include/boost/sort/common/range.hpp:284:46: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 284 | Value_t * ptr_aux = util::merge_construct(src1.first, src1.last, src2.first, - | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - 285 | src2.last, dest.first, comp); - | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/common/range.hpp:284:46: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter3_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]', - inlined from 'boost::sort::common::range boost::sort::common::full_merge4(const range&, range*, uint32_t, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/common/merge_four.hpp:107:21, - inlined from 'void boost::sort::common::merge_level4(range, std::vector >&, std::vector >&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/common/merge_vector.hpp:78:34, - inlined from 'boost::sort::common::range boost::sort::common::merge_vector4(range, range, std::vector >&, std::vector >&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/common/merge_vector.hpp:178:25, - inlined from 'void boost::sort::sample_detail::sample_sort::execute() [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/sample_sort/sample_sort.hpp:176:26: -/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 259 | Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, - | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - 260 | dest.first, comp); - | ~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter3_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]', - inlined from 'boost::sort::common::range boost::sort::common::full_merge4(const range&, range*, uint32_t, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/common/merge_four.hpp:184:34, - inlined from 'void boost::sort::common::merge_level4(range, std::vector >&, std::vector >&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/common/merge_vector.hpp:78:34, - inlined from 'boost::sort::common::range boost::sort::common::merge_vector4(range, range, std::vector >&, std::vector >&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/common/merge_vector.hpp:178:25, - inlined from 'void boost::sort::sample_detail::sample_sort::execute() [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/sample_sort/sample_sort.hpp:176:26: -/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 259 | Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, - | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - 260 | dest.first, comp); - | ~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter3_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]', - inlined from 'boost::sort::common::range boost::sort::common::full_merge4(const range&, range*, uint32_t, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/common/merge_four.hpp:189:36, - inlined from 'void boost::sort::common::merge_level4(range, std::vector >&, std::vector >&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/common/merge_vector.hpp:78:34, - inlined from 'boost::sort::common::range boost::sort::common::merge_vector4(range, range, std::vector >&, std::vector >&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/common/merge_vector.hpp:178:25, - inlined from 'void boost::sort::sample_detail::sample_sort::execute() [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/sample_sort/sample_sort.hpp:176:26: -/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 259 | Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, - | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - 260 | dest.first, comp); - | ~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Iter3_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]', - inlined from 'boost::sort::common::range boost::sort::common::full_merge4(const range&, range*, uint32_t, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/common/merge_four.hpp:107:21, - inlined from 'void boost::sort::common::merge_level4(range, std::vector >&, std::vector >&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/common/merge_vector.hpp:78:34, - inlined from 'boost::sort::common::range boost::sort::common::merge_vector4(range, range, std::vector >&, std::vector >&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/common/merge_vector.hpp:184:25, - inlined from 'void boost::sort::sample_detail::sample_sort::execute() [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/sample_sort/sample_sort.hpp:176:26: -/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 259 | Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, - | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - 260 | dest.first, comp); - | ~~~~~~~~~~~~~~~~~ -In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Iter3_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]', - inlined from 'boost::sort::common::range boost::sort::common::full_merge4(const range&, range*, uint32_t, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/common/merge_four.hpp:184:34, - inlined from 'void boost::sort::common::merge_level4(range, std::vector >&, std::vector >&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/common/merge_vector.hpp:78:34, - inlined from 'boost::sort::common::range boost::sort::common::merge_vector4(range, range, std::vector >&, std::vector >&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/common/merge_vector.hpp:184:25, - inlined from 'void boost::sort::sample_detail::sample_sort::execute() [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/sample_sort/sample_sort.hpp:176:26: -/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 259 | Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, - | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - 260 | dest.first, comp); - | ~~~~~~~~~~~~~~~~~ -In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Iter3_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]', - inlined from 'boost::sort::common::range boost::sort::common::full_merge4(const range&, range*, uint32_t, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/common/merge_four.hpp:189:36, - inlined from 'void boost::sort::common::merge_level4(range, std::vector >&, std::vector >&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/common/merge_vector.hpp:78:34, - inlined from 'boost::sort::common::range boost::sort::common::merge_vector4(range, range, std::vector >&, std::vector >&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/common/merge_vector.hpp:184:25, - inlined from 'void boost::sort::sample_detail::sample_sort::execute() [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/sample_sort/sample_sort.hpp:176:26: -/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 259 | Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, - | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - 260 | dest.first, comp); - | ~~~~~~~~~~~~~~~~~ -In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = long long int; _Alloc = std::allocator]', - inlined from 'veryfasttree::NeighbourJoining::Rates::Rates(int64_t, int64_t) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:183:23, - inlined from 'veryfasttree::NeighbourJoining::NeighbourJoining(veryfasttree::Options&, std::ostream&, veryfasttree::ProgressReport&, std::vector >&, int64_t, std::vector >&, veryfasttree::DistanceMatrix::ALIGNMENT>&, veryfasttree::TransitionMatrix::ALIGNMENT>&, std::unique_ptr&, std::unique_ptr&) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:227:60: -/usr/include/c++/14/bits/stl_vector.h:1037:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 1037 | _M_fill_insert(end(), __new_size - size(), __x); - | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = long long int; _Alloc = std::allocator]', - inlined from 'veryfasttree::NeighbourJoining::NeighbourJoining(veryfasttree::Options&, std::ostream&, veryfasttree::ProgressReport&, std::vector >&, int64_t, std::vector >&, veryfasttree::DistanceMatrix::ALIGNMENT>&, veryfasttree::TransitionMatrix::ALIGNMENT>&, std::unique_ptr&, std::unique_ptr&) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:255:26: -/usr/include/c++/14/bits/stl_vector.h:1037:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 1037 | _M_fill_insert(end(), __new_size - size(), __x); - | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = long long int; _Alloc = std::allocator]', - inlined from 'veryfasttree::NeighbourJoining::NeighbourJoining(veryfasttree::Options&, std::ostream&, veryfasttree::ProgressReport&, std::vector >&, int64_t, std::vector >&, veryfasttree::DistanceMatrix::ALIGNMENT>&, veryfasttree::TransitionMatrix::ALIGNMENT>&, std::unique_ptr&, std::unique_ptr&) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:268:18: -/usr/include/c++/14/bits/stl_vector.h:1037:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 1037 | _M_fill_insert(end(), __new_size - size(), __x); - | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/c++/14/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_fill_insert(iterator, size_type, const value_type&) [with _Tp = veryfasttree::NeighbourJoining::Hit; _Alloc = std::allocator::Hit>]': -/usr/include/c++/14/bits/vector.tcc:700:5: note: parameter passing for argument of type 'std::vector::Hit, std::allocator::Hit> >::iterator' changed in GCC 7.1 - 700 | vector<_Tp, _Alloc>:: - | ^~~~~~~~~~~~~~~~~~~ -In file included from /usr/include/c++/14/memory:69, - from /usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:20: -/usr/include/c++/14/bits/stl_uninitialized.h: In function '_ForwardIterator std::__do_uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator::TopHitsList*, vector::TopHitsList, allocator::TopHitsList> > >; _ForwardIterator = veryfasttree::NeighbourJoining::TopHitsList*]': -/usr/include/c++/14/bits/stl_uninitialized.h:113:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::TopHitsList*, std::vector::TopHitsList, std::allocator::TopHitsList> > >' changed in GCC 7.1 - 113 | __do_uninit_copy(_InputIterator __first, _InputIterator __last, - | ^~~~~~~~~~~~~~~~ -/usr/include/c++/14/bits/stl_uninitialized.h:113:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::TopHitsList*, std::vector::TopHitsList, std::allocator::TopHitsList> > >' changed in GCC 7.1 -In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter3_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]', - inlined from 'boost::sort::common::range boost::sort::common::full_merge4(const range&, range*, uint32_t, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_four.hpp:107:21, - inlined from 'void boost::sort::common::merge_level4(range, std::vector >&, std::vector >&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_vector.hpp:78:34, - inlined from 'boost::sort::common::range boost::sort::common::merge_vector4(range, range, std::vector >&, std::vector >&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_vector.hpp:178:25, - inlined from 'void boost::sort::sample_detail::sample_sort::execute() [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/sample_sort/sample_sort.hpp:176:26: -/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 259 | Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, - | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - 260 | dest.first, comp); - | ~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter3_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]', - inlined from 'boost::sort::common::range boost::sort::common::full_merge4(const range&, range*, uint32_t, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_four.hpp:184:34, - inlined from 'void boost::sort::common::merge_level4(range, std::vector >&, std::vector >&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_vector.hpp:78:34, - inlined from 'boost::sort::common::range boost::sort::common::merge_vector4(range, range, std::vector >&, std::vector >&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_vector.hpp:178:25, - inlined from 'void boost::sort::sample_detail::sample_sort::execute() [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/sample_sort/sample_sort.hpp:176:26: -/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 259 | Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, - | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - 260 | dest.first, comp); - | ~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter3_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]', - inlined from 'boost::sort::common::range boost::sort::common::full_merge4(const range&, range*, uint32_t, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_four.hpp:189:36, - inlined from 'void boost::sort::common::merge_level4(range, std::vector >&, std::vector >&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_vector.hpp:78:34, - inlined from 'boost::sort::common::range boost::sort::common::merge_vector4(range, range, std::vector >&, std::vector >&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_vector.hpp:178:25, - inlined from 'void boost::sort::sample_detail::sample_sort::execute() [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/sample_sort/sample_sort.hpp:176:26: -/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 259 | Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, - | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - 260 | dest.first, comp); - | ~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Iter3_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]', - inlined from 'boost::sort::common::range boost::sort::common::full_merge4(const range&, range*, uint32_t, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_four.hpp:107:21, - inlined from 'void boost::sort::common::merge_level4(range, std::vector >&, std::vector >&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_vector.hpp:78:34, - inlined from 'boost::sort::common::range boost::sort::common::merge_vector4(range, range, std::vector >&, std::vector >&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_vector.hpp:184:25, - inlined from 'void boost::sort::sample_detail::sample_sort::execute() [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/sample_sort/sample_sort.hpp:176:26: -/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 259 | Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, - | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - 260 | dest.first, comp); - | ~~~~~~~~~~~~~~~~~ -In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Iter3_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]', - inlined from 'boost::sort::common::range boost::sort::common::full_merge4(const range&, range*, uint32_t, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_four.hpp:184:34, - inlined from 'void boost::sort::common::merge_level4(range, std::vector >&, std::vector >&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_vector.hpp:78:34, - inlined from 'boost::sort::common::range boost::sort::common::merge_vector4(range, range, std::vector >&, std::vector >&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_vector.hpp:184:25, - inlined from 'void boost::sort::sample_detail::sample_sort::execute() [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/sample_sort/sample_sort.hpp:176:26: -/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 259 | Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, - | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - 260 | dest.first, comp); - | ~~~~~~~~~~~~~~~~~ -In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Iter3_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]', - inlined from 'boost::sort::common::range boost::sort::common::full_merge4(const range&, range*, uint32_t, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_four.hpp:189:36, - inlined from 'void boost::sort::common::merge_level4(range, std::vector >&, std::vector >&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_vector.hpp:78:34, - inlined from 'boost::sort::common::range boost::sort::common::merge_vector4(range, range, std::vector >&, std::vector >&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_vector.hpp:184:25, - inlined from 'void boost::sort::sample_detail::sample_sort::execute() [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/sample_sort/sample_sort.hpp:176:26: -/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 259 | Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, - | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - 260 | dest.first, comp); - | ~~~~~~~~~~~~~~~~~ -In static member function 'static _ForwardIterator std::__uninitialized_copy<_TrivialValueTypes>::__uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator::TopHitsList*, std::vector::TopHitsList, std::allocator::TopHitsList> > >; _ForwardIterator = veryfasttree::NeighbourJoining::TopHitsList*; bool _TrivialValueTypes = false]', - inlined from '_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator::TopHitsList*, vector::TopHitsList, allocator::TopHitsList> > >; _ForwardIterator = veryfasttree::NeighbourJoining::TopHitsList*]' at /usr/include/c++/14/bits/stl_uninitialized.h:185:15, - inlined from '_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = __gnu_cxx::__normal_iterator::TopHitsList*, vector::TopHitsList, allocator::TopHitsList> > >; _ForwardIterator = veryfasttree::NeighbourJoining::TopHitsList*; _Tp = veryfasttree::NeighbourJoining::TopHitsList]' at /usr/include/c++/14/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::TopHitsList*, std::vector::TopHitsList, std::allocator::TopHitsList> > >; _Tp = veryfasttree::NeighbourJoining::TopHitsList; _Alloc = std::allocator::TopHitsList>]' at /usr/include/c++/14/bits/stl_vector.h:1624:35, - inlined from 'std::vector<_Tp, _Alloc>& std::vector<_Tp, _Alloc>::operator=(const std::vector<_Tp, _Alloc>&) [with _Tp = veryfasttree::NeighbourJoining::TopHitsList; _Alloc = std::allocator::TopHitsList>]' at /usr/include/c++/14/bits/vector.tcc:238:44: -/usr/include/c++/14/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::TopHitsList*, std::vector::TopHitsList, std::allocator::TopHitsList> > >' 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::TopHitsList*, std::vector::TopHitsList, std::allocator::TopHitsList> > >; _ForwardIterator = veryfasttree::NeighbourJoining::TopHitsList*; bool _TrivialValueTypes = false]', - inlined from '_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator::TopHitsList*, vector::TopHitsList, allocator::TopHitsList> > >; _ForwardIterator = veryfasttree::NeighbourJoining::TopHitsList*]' at /usr/include/c++/14/bits/stl_uninitialized.h:185:15, - inlined from '_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = __gnu_cxx::__normal_iterator::TopHitsList*, vector::TopHitsList, allocator::TopHitsList> > >; _ForwardIterator = veryfasttree::NeighbourJoining::TopHitsList*; _Tp = veryfasttree::NeighbourJoining::TopHitsList]' at /usr/include/c++/14/bits/stl_uninitialized.h:373:37, - inlined from 'std::vector<_Tp, _Alloc>::vector(const std::vector<_Tp, _Alloc>&) [with _Tp = veryfasttree::NeighbourJoining::TopHitsList; _Alloc = std::allocator::TopHitsList>]' at /usr/include/c++/14/bits/stl_vector.h:606:31, - inlined from 'veryfasttree::NeighbourJoining::TopHits::TopHits(const veryfasttree::NeighbourJoining::TopHits&)' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.h:224:16, - inlined from 'void std::_Construct(_Tp*, _Args&& ...) [with _Tp = veryfasttree::NeighbourJoining::TopHits; _Args = {const veryfasttree::NeighbourJoining::TopHits&}]' at /usr/include/c++/14/bits/stl_construct.h:119:7, - inlined from '_ForwardIterator std::__do_uninit_fill_n(_ForwardIterator, _Size, const _Tp&) [with _ForwardIterator = veryfasttree::NeighbourJoining::TopHits*; _Size = unsigned int; _Tp = veryfasttree::NeighbourJoining::TopHits]' at /usr/include/c++/14/bits/stl_uninitialized.h:267:21: -/usr/include/c++/14/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::TopHitsList*, std::vector::TopHitsList, std::allocator::TopHitsList> > >' changed in GCC 7.1 - 137 | { return std::__do_uninit_copy(__first, __last, __result); } - | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/c++/14/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_fill_insert(iterator, size_type, const value_type&) [with _Tp = veryfasttree::NeighbourJoining::TopHits; _Alloc = std::allocator::TopHits>]': -/usr/include/c++/14/bits/vector.tcc:700:5: note: parameter passing for argument of type 'std::vector::TopHits, std::allocator::TopHits> >::iterator' changed in GCC 7.1 - 700 | vector<_Tp, _Alloc>:: - | ^~~~~~~~~~~~~~~~~~~ -In static member function 'static _ForwardIterator std::__uninitialized_copy<_TrivialValueTypes>::__uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator::TopHitsList*, std::vector::TopHitsList, std::allocator::TopHitsList> > >; _ForwardIterator = veryfasttree::NeighbourJoining::TopHitsList*; bool _TrivialValueTypes = false]', - inlined from '_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator::TopHitsList*, vector::TopHitsList, allocator::TopHitsList> > >; _ForwardIterator = veryfasttree::NeighbourJoining::TopHitsList*]' at /usr/include/c++/14/bits/stl_uninitialized.h:185:15, - inlined from '_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = __gnu_cxx::__normal_iterator::TopHitsList*, vector::TopHitsList, allocator::TopHitsList> > >; _ForwardIterator = veryfasttree::NeighbourJoining::TopHitsList*; _Tp = veryfasttree::NeighbourJoining::TopHitsList]' at /usr/include/c++/14/bits/stl_uninitialized.h:373:37, - inlined from 'std::vector<_Tp, _Alloc>::vector(const std::vector<_Tp, _Alloc>&) [with _Tp = veryfasttree::NeighbourJoining::TopHitsList; _Alloc = std::allocator::TopHitsList>]' at /usr/include/c++/14/bits/stl_vector.h:606:31, - inlined from 'veryfasttree::NeighbourJoining::TopHits::TopHits(const veryfasttree::NeighbourJoining::TopHits&)' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.h:224:16, - inlined from 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = veryfasttree::NeighbourJoining::TopHits; _Args = {const veryfasttree::NeighbourJoining::TopHits&}; _Tp = veryfasttree::NeighbourJoining::TopHits]' at /usr/include/c++/14/bits/new_allocator.h:191:4, - inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = veryfasttree::NeighbourJoining::TopHits; _Args = {const veryfasttree::NeighbourJoining::TopHits&}; _Tp = veryfasttree::NeighbourJoining::TopHits]' at /usr/include/c++/14/bits/alloc_traits.h:569:17, - inlined from 'std::vector<_Tp, _Alloc>::_Temporary_value::_Temporary_value(std::vector<_Tp, _Alloc>*, _Args&& ...) [with _Args = {const veryfasttree::NeighbourJoining::TopHits&}; _Tp = veryfasttree::NeighbourJoining::TopHits; _Alloc = std::allocator::TopHits>]' at /usr/include/c++/14/bits/stl_vector.h:1840:30, - inlined from 'void std::vector<_Tp, _Alloc>::_M_fill_insert(iterator, size_type, const value_type&) [with _Tp = veryfasttree::NeighbourJoining::TopHits; _Alloc = std::allocator::TopHits>]' at /usr/include/c++/14/bits/vector.tcc:711:25: -/usr/include/c++/14/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::TopHitsList*, std::vector::TopHitsList, std::allocator::TopHitsList> > >' changed in GCC 7.1 - 137 | { return std::__do_uninit_copy(__first, __last, __result); } - | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/c++/14/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_fill_insert(iterator, size_type, const value_type&) [with _Tp = veryfasttree::NeighbourJoining::TopHitsList; _Alloc = std::allocator::TopHitsList>]': -/usr/include/c++/14/bits/vector.tcc:700:5: note: parameter passing for argument of type 'std::vector::TopHitsList, std::allocator::TopHitsList> >::iterator' changed in GCC 7.1 - 700 | vector<_Tp, _Alloc>:: - | ^~~~~~~~~~~~~~~~~~~ -In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = veryfasttree::NeighbourJoining::TopHitsList; _Alloc = std::allocator::TopHitsList>]', - inlined from 'veryfasttree::NeighbourJoining::TopHits::TopHits(const veryfasttree::Options&, int64_t, int64_t) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:204:24, - inlined from 'std::unique_ptr veryfasttree::make_unique2(Args&& ...) [with T = NeighbourJoining::TopHits; Args = {Options&, long long int&, long long int&}]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../Utils.h:81:35: -/usr/include/c++/14/bits/stl_vector.h:1037:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::TopHitsList*, std::vector::TopHitsList, std::allocator::TopHitsList> > >' changed in GCC 7.1 - 1037 | _M_fill_insert(end(), __new_size - size(), __x); - | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = veryfasttree::NeighbourJoining::Hit; _Alloc = std::allocator::Hit>]', - inlined from 'veryfasttree::NeighbourJoining::TopHits::TopHits(const veryfasttree::Options&, int64_t, int64_t) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:205:19, - inlined from 'std::unique_ptr veryfasttree::make_unique2(Args&& ...) [with T = NeighbourJoining::TopHits; Args = {Options&, long long int&, long long int&}]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../Utils.h:81:35: -/usr/include/c++/14/bits/stl_vector.h:1037:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Hit*, std::vector::Hit, std::allocator::Hit> > >' changed in GCC 7.1 - 1037 | _M_fill_insert(end(), __new_size - size(), __x); - | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = long long int; _Alloc = std::allocator]', - inlined from 'veryfasttree::NeighbourJoining::TopHits::TopHits(const veryfasttree::Options&, int64_t, int64_t) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:207:22, - inlined from 'std::unique_ptr veryfasttree::make_unique2(Args&& ...) [with T = NeighbourJoining::TopHits; Args = {Options&, long long int&, long long int&}]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../Utils.h:81:35: -/usr/include/c++/14/bits/stl_vector.h:1037:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 1037 | _M_fill_insert(end(), __new_size - size(), __x); - | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/spinsort/spinsort.hpp: In function 'void boost::sort::spin_detail::insert_partial_sort(Iter1_t, Iter1_t, Iter1_t, Compare, const boost::sort::common::range&) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]': -/usr/include/boost/sort/spinsort/spinsort.hpp:86:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 86 | static void insert_partial_sort (Iter1_t first, Iter1_t mid, Iter1_t last, - | ^~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/spinsort/spinsort.hpp:86:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 -/usr/include/boost/sort/spinsort/spinsort.hpp:86:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 -/usr/include/boost/sort/spinsort/spinsort.hpp: In function 'bool boost::sort::spin_detail::check_stable_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]': -/usr/include/boost/sort/spinsort/spinsort.hpp:175:20: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 175 | insert_sort(rng_data.first, rng_data.last, comp); - | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/spinsort/spinsort.hpp:195:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 195 | insert_partial_sort(rng_data.first, it2, rng_data.last, comp, rng_aux); - | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/spinsort/spinsort.hpp:219:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 219 | insert_partial_sort(rng_data.first, it2, rng_data.last, comp, rng_aux); - | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/spinsort/spinsort.hpp: In function 'void boost::sort::spin_detail::range_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare, uint32_t) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]': -/usr/include/boost/sort/spinsort/spinsort.hpp:284:20: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 284 | insert_sort(range_input1.first, range_input1.last, comp); - | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/spinsort/spinsort.hpp:285:20: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 285 | insert_sort(range_input2.first, range_input2.last, comp); - | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/spinsort/spinsort.hpp: In function 'void boost::sort::spin_detail::sort_range_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]': -/usr/include/boost/sort/spinsort/spinsort.hpp:327:20: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 327 | insert_sort(rng_data.first, rng_data.last, comp); - | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/spinsort/spinsort.hpp: In function 'void boost::sort::spin_detail::insert_partial_sort(Iter1_t, Iter1_t, Iter1_t, Compare, const boost::sort::common::range&) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = long long int*; Compare = veryfasttree::NeighbourJoining::CompareSeeds]': -/usr/include/boost/sort/spinsort/spinsort.hpp:86:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 86 | static void insert_partial_sort (Iter1_t first, Iter1_t mid, Iter1_t last, - | ^~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/spinsort/spinsort.hpp:86:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 -/usr/include/boost/sort/spinsort/spinsort.hpp:86:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 -/usr/include/boost/sort/spinsort/spinsort.hpp: In function 'void boost::sort::spin_detail::insert_partial_sort(Iter1_t, Iter1_t, Iter1_t, Compare, const boost::sort::common::range&) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]': -/usr/include/boost/sort/spinsort/spinsort.hpp:86:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -/usr/include/boost/sort/spinsort/spinsort.hpp:86:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -/usr/include/boost/sort/spinsort/spinsort.hpp:86:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -/usr/include/boost/sort/spinsort/spinsort.hpp: In function 'bool boost::sort::spin_detail::check_stable_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]': -/usr/include/boost/sort/spinsort/spinsort.hpp:175:20: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 175 | insert_sort(rng_data.first, rng_data.last, comp); - | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/spinsort/spinsort.hpp:195:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 195 | insert_partial_sort(rng_data.first, it2, rng_data.last, comp, rng_aux); - | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/spinsort/spinsort.hpp:219:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 219 | insert_partial_sort(rng_data.first, it2, rng_data.last, comp, rng_aux); - | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/spinsort/spinsort.hpp: In function 'void boost::sort::spin_detail::range_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare, uint32_t) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]': -/usr/include/boost/sort/spinsort/spinsort.hpp:284:20: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 284 | insert_sort(range_input1.first, range_input1.last, comp); - | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/spinsort/spinsort.hpp:285:20: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 285 | insert_sort(range_input2.first, range_input2.last, comp); - | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/spinsort/spinsort.hpp: In function 'void boost::sort::spin_detail::sort_range_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]': -/usr/include/boost/sort/spinsort/spinsort.hpp:327:20: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 327 | insert_sort(rng_data.first, rng_data.last, comp); - | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/spinsort/spinsort.hpp: In function 'void boost::sort::spin_detail::insert_partial_sort(Iter1_t, Iter1_t, Iter1_t, Compare, const boost::sort::common::range&) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]': -/usr/include/boost/sort/spinsort/spinsort.hpp:86:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 86 | static void insert_partial_sort (Iter1_t first, Iter1_t mid, Iter1_t last, - | ^~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/spinsort/spinsort.hpp:86:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -/usr/include/boost/sort/spinsort/spinsort.hpp:86:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -/usr/include/boost/sort/spinsort/spinsort.hpp: In function 'void boost::sort::spin_detail::insert_partial_sort(Iter1_t, Iter1_t, Iter1_t, Compare, const boost::sort::common::range&) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]': -/usr/include/boost/sort/spinsort/spinsort.hpp:86:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -/usr/include/boost/sort/spinsort/spinsort.hpp:86:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -/usr/include/boost/sort/spinsort/spinsort.hpp:86:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -/usr/include/boost/sort/spinsort/spinsort.hpp: In function 'bool boost::sort::spin_detail::check_stable_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]': -/usr/include/boost/sort/spinsort/spinsort.hpp:175:20: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 175 | insert_sort(rng_data.first, rng_data.last, comp); - | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/spinsort/spinsort.hpp:195:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 195 | insert_partial_sort(rng_data.first, it2, rng_data.last, comp, rng_aux); - | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/spinsort/spinsort.hpp:219:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 219 | insert_partial_sort(rng_data.first, it2, rng_data.last, comp, rng_aux); - | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/sample_sort/sample_sort.hpp: In constructor 'boost::sort::sample_detail::sample_sort::sample_sort(Iter_t, Iter_t, Compare, uint32_t, value_t*, size_t) [with Iter_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]': -/usr/include/boost/sort/sample_sort/sample_sort.hpp:239:1: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 239 | sample_sort - | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/sample_sort/sample_sort.hpp:239:1: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 -In constructor 'boost::sort::spin_detail::spinsort::spinsort(Iter_t, Iter_t, Compare) [with Iter_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]', - inlined from 'boost::sort::sample_detail::sample_sort::sample_sort(Iter_t, Iter_t, Compare, uint32_t, value_t*, size_t) [with Iter_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]' at /usr/include/boost/sort/sample_sort/sample_sort.hpp:260:14: -/usr/include/boost/sort/spinsort/spinsort.hpp:403:45: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 403 | : spinsort(first, last, comp, nullptr, 0) { }; - | ^ -/usr/include/boost/sort/spinsort/spinsort.hpp: In function 'void boost::sort::spin_detail::range_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare, uint32_t) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]': -/usr/include/boost/sort/spinsort/spinsort.hpp:284:20: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 284 | insert_sort(range_input1.first, range_input1.last, comp); - | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/spinsort/spinsort.hpp:285:20: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 285 | insert_sort(range_input2.first, range_input2.last, comp); - | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/spinsort/spinsort.hpp: In function 'void boost::sort::spin_detail::sort_range_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]': -/usr/include/boost/sort/spinsort/spinsort.hpp:327:20: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 327 | insert_sort(rng_data.first, rng_data.last, comp); - | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/spinsort/spinsort.hpp: In function 'void boost::sort::spin_detail::insert_partial_sort(Iter1_t, Iter1_t, Iter1_t, Compare, const boost::sort::common::range&) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]': -/usr/include/boost/sort/spinsort/spinsort.hpp:86:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 86 | static void insert_partial_sort (Iter1_t first, Iter1_t mid, Iter1_t last, - | ^~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/spinsort/spinsort.hpp:86:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -/usr/include/boost/sort/spinsort/spinsort.hpp:86:13: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -/usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp: In constructor 'boost::sort::stable_detail::parallel_stable_sort::parallel_stable_sort(Iter_t, Iter_t, Compare, uint32_t) [with Iter_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]': -/usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:124:1: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 124 | parallel_stable_sort - | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:124:1: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 -In constructor 'boost::sort::spin_detail::spinsort::spinsort(Iter_t, Iter_t, Compare) [with Iter_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]', - inlined from 'boost::sort::stable_detail::parallel_stable_sort::parallel_stable_sort(Iter_t, Iter_t, Compare, uint32_t) [with Iter_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]' at /usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:136:14: -/usr/include/boost/sort/spinsort/spinsort.hpp:403:45: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 403 | : spinsort(first, last, comp, nullptr, 0) { }; - | ^ -In constructor 'boost::sort::sample_detail::sample_sort::sample_sort(Iter_t, Iter_t, Compare, uint32_t, range_buf) [with Iter_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]', - inlined from 'boost::sort::stable_detail::parallel_stable_sort::parallel_stable_sort(Iter_t, Iter_t, Compare, uint32_t) [with Iter_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]' at /usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:176:9: -/usr/include/boost/sort/sample_sort/sample_sort.hpp:142:68: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 142 | range_buf_initial.first, range_buf_initial.size()) { }; - | ^ -In constructor 'boost::sort::sample_detail::sample_sort::sample_sort(Iter_t, Iter_t, Compare, uint32_t, range_buf) [with Iter_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]', - inlined from 'boost::sort::stable_detail::parallel_stable_sort::parallel_stable_sort(Iter_t, Iter_t, Compare, uint32_t) [with Iter_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]' at /usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:187:9: -/usr/include/boost/sort/sample_sort/sample_sort.hpp:142:68: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 142 | range_buf_initial.first, range_buf_initial.size()) { }; - | ^ -In function 'boost::sort::common::range boost::sort::common::merge_half(const range&, const range&, const range&, Compare) [with Iter1_t = long long int*; Iter2_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]', - inlined from 'boost::sort::stable_detail::parallel_stable_sort::parallel_stable_sort(Iter_t, Iter_t, Compare, uint32_t) [with Iter_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]' at /usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:197:31: -/usr/include/boost/sort/common/range.hpp:307:38: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 307 | Iter2_t it_aux = util::merge_half(src1.first, src1.last, src2.first, - | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - 308 | src2.last, dest.first, comp); - | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/common/range.hpp:307:38: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 -In function 'boost::sort::common::range boost::sort::common::merge_construct(const range&, const range&, const range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = __gnu_cxx::__normal_iterator >; Value_t = long long int; Compare = veryfasttree::NeighbourJoining::CompareSeeds]', - inlined from 'boost::sort::common::range boost::sort::common::uninit_full_merge4(const range&, range*, uint32_t, Compare) [with Value_t = long long int; Iter_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]' at /usr/include/boost/sort/common/merge_four.hpp:236:31: -/usr/include/boost/sort/common/range.hpp:284:46: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 284 | Value_t * ptr_aux = util::merge_construct(src1.first, src1.last, src2.first, - | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - 285 | src2.last, dest.first, comp); - | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/common/range.hpp:284:46: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 -In function 'boost::sort::common::range boost::sort::common::merge_construct(const range&, const range&, const range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = __gnu_cxx::__normal_iterator >; Value_t = long long int; Compare = veryfasttree::NeighbourJoining::CompareSeeds]', - inlined from 'boost::sort::common::range boost::sort::common::uninit_full_merge4(const range&, range*, uint32_t, Compare) [with Value_t = long long int; Iter_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]' at /usr/include/boost/sort/common/merge_four.hpp:312:38: -/usr/include/boost/sort/common/range.hpp:284:46: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 284 | Value_t * ptr_aux = util::merge_construct(src1.first, src1.last, src2.first, - | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - 285 | src2.last, dest.first, comp); - | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/common/range.hpp:284:46: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 -In function 'boost::sort::common::range boost::sort::common::merge_construct(const range&, const range&, const range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = __gnu_cxx::__normal_iterator >; Value_t = long long int; Compare = veryfasttree::NeighbourJoining::CompareSeeds]', - inlined from 'boost::sort::common::range boost::sort::common::uninit_full_merge4(const range&, range*, uint32_t, Compare) [with Value_t = long long int; Iter_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]' at /usr/include/boost/sort/common/merge_four.hpp:318:38: -/usr/include/boost/sort/common/range.hpp:284:46: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 284 | Value_t * ptr_aux = util::merge_construct(src1.first, src1.last, src2.first, - | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - 285 | src2.last, dest.first, comp); - | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/common/range.hpp:284:46: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 -In function 'void boost::sort::parallel_stable_sort(Iter_t, Iter_t, Compare, uint32_t) [with Iter_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]', - inlined from 'void veryfasttree::psort(Iter, Iter, const Compare&, bool) [with Iter = __gnu_cxx::__normal_iterator >; Compare = NeighbourJoining::CompareSeeds]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../Utils.h:145:42, - inlined from 'void veryfasttree::NeighbourJoining::setAllLeafTopHits(TopHits&) [with Precision = double; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:3770:10: -/usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:291:20: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 291 | stable_detail::parallel_stable_sort - | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - 292 | (first, last, comp, nthread); - | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -In static member function 'static _ForwardIterator std::__uninitialized_copy<_TrivialValueTypes>::__uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator::TopHitsList*, std::vector::TopHitsList, std::allocator::TopHitsList> > >; _ForwardIterator = veryfasttree::NeighbourJoining::TopHitsList*; bool _TrivialValueTypes = false]', - inlined from '_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator::TopHitsList*, vector::TopHitsList, allocator::TopHitsList> > >; _ForwardIterator = veryfasttree::NeighbourJoining::TopHitsList*]' at /usr/include/c++/14/bits/stl_uninitialized.h:185:15, - inlined from '_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = __gnu_cxx::__normal_iterator::TopHitsList*, vector::TopHitsList, allocator::TopHitsList> > >; _ForwardIterator = veryfasttree::NeighbourJoining::TopHitsList*; _Tp = veryfasttree::NeighbourJoining::TopHitsList]' at /usr/include/c++/14/bits/stl_uninitialized.h:373:37, - inlined from 'std::vector<_Tp, _Alloc>::vector(const std::vector<_Tp, _Alloc>&) [with _Tp = veryfasttree::NeighbourJoining::TopHitsList; _Alloc = std::allocator::TopHitsList>]' at /usr/include/c++/14/bits/stl_vector.h:606:31, - inlined from 'veryfasttree::NeighbourJoining::TopHits::TopHits(const veryfasttree::NeighbourJoining::TopHits&)' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.h:224:16, - inlined from 'void veryfasttree::NeighbourJoining::setAllLeafTopHits(TopHits&) [with Precision = double; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:3886:21: -/usr/include/c++/14/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::TopHitsList*, std::vector::TopHitsList, std::allocator::TopHitsList> > >' changed in GCC 7.1 - 137 | { return std::__do_uninit_copy(__first, __last, __result); } - | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ -In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = veryfasttree::NeighbourJoining::TopHits; _Alloc = std::allocator::TopHits>]', - inlined from 'void veryfasttree::NeighbourJoining::setAllLeafTopHits(TopHits&) [with Precision = double; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:3889:33: -/usr/include/c++/14/bits/stl_vector.h:1037:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::TopHits*, std::vector::TopHits, std::allocator::TopHits> > >' changed in GCC 7.1 - 1037 | _M_fill_insert(end(), __new_size - size(), __x); - | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/spinsort/spinsort.hpp: In function 'void boost::sort::spin_detail::range_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare, uint32_t) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = long long int*; Compare = veryfasttree::NeighbourJoining::CompareSeeds]': -/usr/include/boost/sort/spinsort/spinsort.hpp:284:20: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 284 | insert_sort(range_input1.first, range_input1.last, comp); - | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/spinsort/spinsort.hpp:285:20: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 285 | insert_sort(range_input2.first, range_input2.last, comp); - | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = __gnu_cxx::__normal_iterator >; Iter3_t = long long int*; Compare = veryfasttree::NeighbourJoining::CompareSeeds]', - inlined from 'void boost::sort::spin_detail::range_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare, uint32_t) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = long long int*; Compare = veryfasttree::NeighbourJoining::CompareSeeds]' at /usr/include/boost/sort/spinsort/spinsort.hpp:296:10: -/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 259 | Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, - | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - 260 | dest.first, comp); - | ~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 -/usr/include/boost/sort/spinsort/spinsort.hpp: In function 'void boost::sort::spin_detail::sort_range_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = long long int*; Compare = veryfasttree::NeighbourJoining::CompareSeeds]': -/usr/include/boost/sort/spinsort/spinsort.hpp:327:20: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 327 | insert_sort(rng_data.first, rng_data.last, comp); - | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/spinsort/spinsort.hpp: In function 'bool boost::sort::spin_detail::check_stable_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = long long int*; Compare = veryfasttree::NeighbourJoining::CompareSeeds]': -/usr/include/boost/sort/spinsort/spinsort.hpp:175:20: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 175 | insert_sort(rng_data.first, rng_data.last, comp); - | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/spinsort/spinsort.hpp:195:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 195 | insert_partial_sort(rng_data.first, it2, rng_data.last, comp, rng_aux); - | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/spinsort/spinsort.hpp:219:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 219 | insert_partial_sort(rng_data.first, it2, rng_data.last, comp, rng_aux); - | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = long long int*; Iter2_t = long long int*; Iter3_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]', - inlined from 'void boost::sort::spin_detail::range_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare, uint32_t) [with Iter1_t = long long int*; Iter2_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]' at /usr/include/boost/sort/spinsort/spinsort.hpp:296:10: -/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 259 | Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, - | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - 260 | dest.first, comp); - | ~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/spinsort/spinsort.hpp: In constructor 'boost::sort::spin_detail::spinsort::spinsort(Iter_t, Iter_t, Compare, value_t*, size_t) [with Iter_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]': -/usr/include/boost/sort/spinsort/spinsort.hpp:441:1: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 441 | spinsort - | ^~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/spinsort/spinsort.hpp:441:1: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 -/usr/include/boost/sort/spinsort/spinsort.hpp:457:20: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 457 | insert_sort(range_input.first, range_input.last, comp); - | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -In function 'boost::sort::common::range boost::sort::common::merge_half(const range&, const range&, const range&, Compare) [with Iter1_t = long long int*; Iter2_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]', - inlined from 'boost::sort::spin_detail::spinsort::spinsort(Iter_t, Iter_t, Compare, value_t*, size_t) [with Iter_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]' at /usr/include/boost/sort/spinsort/spinsort.hpp:512:19: -/usr/include/boost/sort/common/range.hpp:307:38: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 307 | Iter2_t it_aux = util::merge_half(src1.first, src1.last, src2.first, - | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - 308 | src2.last, dest.first, comp); - | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/common/range.hpp:307:38: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 -In function 'boost::sort::common::range boost::sort::common::merge_half(const range&, const range&, const range&, Compare) [with Iter1_t = long long int*; Iter2_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]', - inlined from 'boost::sort::spin_detail::spinsort::spinsort(Iter_t, Iter_t, Compare, value_t*, size_t) [with Iter_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]' at /usr/include/boost/sort/spinsort/spinsort.hpp:530:19: -/usr/include/boost/sort/common/range.hpp:307:38: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 307 | Iter2_t it_aux = util::merge_half(src1.first, src1.last, src2.first, - | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - 308 | src2.last, dest.first, comp); - | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/common/range.hpp:307:38: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 -In constructor 'boost::sort::spin_detail::spinsort::spinsort(Iter_t, Iter_t, Compare, range_buf) [with Iter_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]', - inlined from 'boost::sort::sample_detail::sample_sort<__gnu_cxx::__normal_iterator >, veryfasttree::NeighbourJoining::CompareSeeds>::initial_configuration()::' at /usr/include/boost/sort/sample_sort/sample_sort.hpp:378:18, - inlined from 'constexpr _Res std::__invoke_impl(__invoke_other, _Fn&&, _Args&& ...) [with _Res = void; _Fn = boost::sort::sample_detail::sample_sort<__gnu_cxx::__normal_iterator >, veryfasttree::NeighbourJoining::CompareSeeds>::initial_configuration()::; _Args = {}]' at /usr/include/c++/14/bits/invoke.h:61:36, - inlined from 'constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = boost::sort::sample_detail::sample_sort<__gnu_cxx::__normal_iterator >, veryfasttree::NeighbourJoining::CompareSeeds>::initial_configuration()::; _Args = {}]' at /usr/include/c++/14/bits/invoke.h:96:40, - inlined from 'typename std::thread::_Invoker<_Tuple>::__result<_Tuple>::type std::thread::_Invoker<_Tuple>::_M_invoke(std::_Index_tuple<_Ind ...>) [with unsigned int ..._Ind = {0}; _Tuple = std::tuple >, veryfasttree::NeighbourJoining::CompareSeeds>::initial_configuration():: >]' at /usr/include/c++/14/bits/std_thread.h:301:26, - inlined from 'typename std::thread::_Invoker<_Tuple>::__result<_Tuple>::type std::thread::_Invoker<_Tuple>::operator()() [with _Tuple = std::tuple >, veryfasttree::NeighbourJoining::CompareSeeds>::initial_configuration():: >]' at /usr/include/c++/14/bits/std_thread.h:308:20, - inlined from '_Ptr_type std::__future_base::_Task_setter<_Ptr_type, _Fn, void>::operator()() const [with _Ptr_type = std::unique_ptr, std::__future_base::_Result_base::_Deleter>; _Fn = std::thread::_Invoker >, veryfasttree::NeighbourJoining::CompareSeeds>::initial_configuration():: > >]' at /usr/include/c++/14/future:1439:14, - inlined from 'constexpr _Res std::__invoke_impl(__invoke_other, _Fn&&, _Args&& ...) [with _Res = unique_ptr<__future_base::_Result, __future_base::_Result_base::_Deleter>; _Fn = __future_base::_Task_setter, __future_base::_Result_base::_Deleter>, thread::_Invoker >, veryfasttree::NeighbourJoining::CompareSeeds>::initial_configuration():: > >, void>&; _Args = {}]' at /usr/include/c++/14/bits/invoke.h:61:67, - inlined from 'constexpr std::__enable_if_t<((bool)(! std::is_void< >::value)), _Res> std::__invoke_r(_Callable&&, _Args&& ...) [with _Res = unique_ptr<__future_base::_Result_base, __future_base::_Result_base::_Deleter>; _Callable = __future_base::_Task_setter, __future_base::_Result_base::_Deleter>, thread::_Invoker >, veryfasttree::NeighbourJoining::CompareSeeds>::initial_configuration():: > >, void>&; _Args = {}]' at /usr/include/c++/14/bits/invoke.h:138:40, - inlined from 'static _Res std::_Function_handler<_Res(_ArgTypes ...), _Functor>::_M_invoke(const std::_Any_data&, _ArgTypes&& ...) [with _Res = std::unique_ptr; _Functor = std::__future_base::_Task_setter, std::__future_base::_Result_base::_Deleter>, std::thread::_Invoker >, veryfasttree::NeighbourJoining::CompareSeeds>::initial_configuration():: > >, void>; _ArgTypes = {}]' at /usr/include/c++/14/bits/std_function.h:291:44: -/usr/include/boost/sort/spinsort/spinsort.hpp:406:68: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 406 | : spinsort(first, last, comp, range_aux.first, range_aux.size()) { }; - | ^ -In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = __gnu_cxx::__normal_iterator >; Iter3_t = long long int*; Compare = veryfasttree::NeighbourJoining::CompareSeeds]', - inlined from 'boost::sort::common::range boost::sort::common::full_merge4(const range&, range*, uint32_t, Compare) [with Iter1_t = long long int*; Iter2_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]' at /usr/include/boost/sort/common/merge_four.hpp:107:21: -/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 259 | Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, - | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - 260 | dest.first, comp); - | ~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 -In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = __gnu_cxx::__normal_iterator >; Iter3_t = long long int*; Compare = veryfasttree::NeighbourJoining::CompareSeeds]', - inlined from 'boost::sort::common::range boost::sort::common::full_merge4(const range&, range*, uint32_t, Compare) [with Iter1_t = long long int*; Iter2_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]' at /usr/include/boost/sort/common/merge_four.hpp:184:34: -/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 259 | Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, - | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - 260 | dest.first, comp); - | ~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 -In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = __gnu_cxx::__normal_iterator >; Iter3_t = long long int*; Compare = veryfasttree::NeighbourJoining::CompareSeeds]', - inlined from 'boost::sort::common::range boost::sort::common::full_merge4(const range&, range*, uint32_t, Compare) [with Iter1_t = long long int*; Iter2_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]' at /usr/include/boost/sort/common/merge_four.hpp:189:36: -/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 259 | Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, - | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - 260 | dest.first, comp); - | ~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 -In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = long long int*; Iter2_t = long long int*; Iter3_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]', - inlined from 'boost::sort::common::range boost::sort::common::full_merge4(const range&, range*, uint32_t, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = long long int*; Compare = veryfasttree::NeighbourJoining::CompareSeeds]' at /usr/include/boost/sort/common/merge_four.hpp:107:21: -/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 259 | Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, - | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - 260 | dest.first, comp); - | ~~~~~~~~~~~~~~~~~ -In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = long long int*; Iter2_t = long long int*; Iter3_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]', - inlined from 'boost::sort::common::range boost::sort::common::full_merge4(const range&, range*, uint32_t, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = long long int*; Compare = veryfasttree::NeighbourJoining::CompareSeeds]' at /usr/include/boost/sort/common/merge_four.hpp:184:34: -/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 259 | Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, - | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - 260 | dest.first, comp); - | ~~~~~~~~~~~~~~~~~ -In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = long long int*; Iter2_t = long long int*; Iter3_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]', - inlined from 'boost::sort::common::range boost::sort::common::full_merge4(const range&, range*, uint32_t, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator >; Iter2_t = long long int*; Compare = veryfasttree::NeighbourJoining::CompareSeeds]' at /usr/include/boost/sort/common/merge_four.hpp:189:36: -/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 - 259 | Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, - | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - 260 | dest.first, comp); - | ~~~~~~~~~~~~~~~~~ -In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Iter3_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]', - inlined from 'void boost::sort::spin_detail::range_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare, uint32_t) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/spinsort/spinsort.hpp:296:10: -/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 259 | Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, - | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - 260 | dest.first, comp); - | ~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/spinsort/spinsort.hpp: In function 'void boost::sort::spin_detail::sort_range_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]': -/usr/include/boost/sort/spinsort/spinsort.hpp:327:20: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 327 | insert_sort(rng_data.first, rng_data.last, comp); - | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/spinsort/spinsort.hpp: In function 'bool boost::sort::spin_detail::check_stable_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]': -/usr/include/boost/sort/spinsort/spinsort.hpp:175:20: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 175 | insert_sort(rng_data.first, rng_data.last, comp); - | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/spinsort/spinsort.hpp:195:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 195 | insert_partial_sort(rng_data.first, it2, rng_data.last, comp, rng_aux); - | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/spinsort/spinsort.hpp:219:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 219 | insert_partial_sort(rng_data.first, it2, rng_data.last, comp, rng_aux); - | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/spinsort/spinsort.hpp: In function 'void boost::sort::spin_detail::range_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare, uint32_t) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]': -/usr/include/boost/sort/spinsort/spinsort.hpp:284:20: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 284 | insert_sort(range_input1.first, range_input1.last, comp); - | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/spinsort/spinsort.hpp:285:20: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 285 | insert_sort(range_input2.first, range_input2.last, comp); - | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter3_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]', - inlined from 'void boost::sort::spin_detail::range_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare, uint32_t) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/spinsort/spinsort.hpp:296:10: -/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 259 | Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, - | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - 260 | dest.first, comp); - | ~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -/usr/include/boost/sort/spinsort/spinsort.hpp: In constructor 'boost::sort::spin_detail::spinsort::spinsort(Iter_t, Iter_t, Compare, value_t*, size_t) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]': -/usr/include/boost/sort/spinsort/spinsort.hpp:441:1: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 441 | spinsort - | ^~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/spinsort/spinsort.hpp:441:1: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -/usr/include/boost/sort/spinsort/spinsort.hpp:457:20: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 457 | insert_sort(range_input.first, range_input.last, comp); - | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -In function 'boost::sort::common::range boost::sort::common::merge_half(const range&, const range&, const range&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]', - inlined from 'boost::sort::spin_detail::spinsort::spinsort(Iter_t, Iter_t, Compare, value_t*, size_t) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/spinsort/spinsort.hpp:512:19: -/usr/include/boost/sort/common/range.hpp:307:38: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 307 | Iter2_t it_aux = util::merge_half(src1.first, src1.last, src2.first, - | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - 308 | src2.last, dest.first, comp); - | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/common/range.hpp:307:38: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -In function 'boost::sort::common::range boost::sort::common::merge_half(const range&, const range&, const range&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]', - inlined from 'boost::sort::spin_detail::spinsort::spinsort(Iter_t, Iter_t, Compare, value_t*, size_t) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/spinsort/spinsort.hpp:530:19: -/usr/include/boost/sort/common/range.hpp:307:38: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 307 | Iter2_t it_aux = util::merge_half(src1.first, src1.last, src2.first, - | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - 308 | src2.last, dest.first, comp); - | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/common/range.hpp:307:38: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -In constructor 'boost::sort::spin_detail::spinsort::spinsort(Iter_t, Iter_t, Compare, range_buf) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]', - inlined from 'boost::sort::sample_detail::sample_sort<__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >, veryfasttree::NeighbourJoining::CompareHitsByIJ>::initial_configuration()::' at /usr/include/boost/sort/sample_sort/sample_sort.hpp:378:18, - inlined from 'constexpr _Res std::__invoke_impl(__invoke_other, _Fn&&, _Args&& ...) [with _Res = void; _Fn = boost::sort::sample_detail::sample_sort<__gnu_cxx::__normal_iterator::Besthit*, vector::Besthit, allocator::Besthit> > >, veryfasttree::NeighbourJoining::CompareHitsByIJ>::initial_configuration()::; _Args = {}]' at /usr/include/c++/14/bits/invoke.h:61:36, - inlined from 'constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = boost::sort::sample_detail::sample_sort<__gnu_cxx::__normal_iterator::Besthit*, vector::Besthit, allocator::Besthit> > >, veryfasttree::NeighbourJoining::CompareHitsByIJ>::initial_configuration()::; _Args = {}]' at /usr/include/c++/14/bits/invoke.h:96:40, - inlined from 'typename std::thread::_Invoker<_Tuple>::__result<_Tuple>::type std::thread::_Invoker<_Tuple>::_M_invoke(std::_Index_tuple<_Ind ...>) [with unsigned int ..._Ind = {0}; _Tuple = std::tuple::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >, veryfasttree::NeighbourJoining::CompareHitsByIJ>::initial_configuration():: >]' at /usr/include/c++/14/bits/std_thread.h:301:26, - inlined from 'typename std::thread::_Invoker<_Tuple>::__result<_Tuple>::type std::thread::_Invoker<_Tuple>::operator()() [with _Tuple = std::tuple::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >, veryfasttree::NeighbourJoining::CompareHitsByIJ>::initial_configuration():: >]' at /usr/include/c++/14/bits/std_thread.h:308:20, - inlined from '_Ptr_type std::__future_base::_Task_setter<_Ptr_type, _Fn, void>::operator()() const [with _Ptr_type = std::unique_ptr, std::__future_base::_Result_base::_Deleter>; _Fn = std::thread::_Invoker::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >, veryfasttree::NeighbourJoining::CompareHitsByIJ>::initial_configuration():: > >]' at /usr/include/c++/14/future:1439:14, - inlined from 'constexpr _Res std::__invoke_impl(__invoke_other, _Fn&&, _Args&& ...) [with _Res = unique_ptr<__future_base::_Result, __future_base::_Result_base::_Deleter>; _Fn = __future_base::_Task_setter, __future_base::_Result_base::_Deleter>, thread::_Invoker::Besthit*, vector::Besthit, allocator::Besthit> > >, veryfasttree::NeighbourJoining::CompareHitsByIJ>::initial_configuration():: > >, void>&; _Args = {}]' at /usr/include/c++/14/bits/invoke.h:61:67, - inlined from 'constexpr std::__enable_if_t<((bool)(! std::is_void< >::value)), _Res> std::__invoke_r(_Callable&&, _Args&& ...) [with _Res = unique_ptr<__future_base::_Result_base, __future_base::_Result_base::_Deleter>; _Callable = __future_base::_Task_setter, __future_base::_Result_base::_Deleter>, thread::_Invoker::Besthit*, vector::Besthit, allocator::Besthit> > >, veryfasttree::NeighbourJoining::CompareHitsByIJ>::initial_configuration():: > >, void>&; _Args = {}]' at /usr/include/c++/14/bits/invoke.h:138:40, - inlined from 'static _Res std::_Function_handler<_Res(_ArgTypes ...), _Functor>::_M_invoke(const std::_Any_data&, _ArgTypes&& ...) [with _Res = std::unique_ptr; _Functor = std::__future_base::_Task_setter, std::__future_base::_Result_base::_Deleter>, std::thread::_Invoker::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >, veryfasttree::NeighbourJoining::CompareHitsByIJ>::initial_configuration():: > >, void>; _ArgTypes = {}]' at /usr/include/c++/14/bits/std_function.h:291:44: -/usr/include/boost/sort/spinsort/spinsort.hpp:406:68: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 406 | : spinsort(first, last, comp, range_aux.first, range_aux.size()) { }; - | ^ -In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Iter3_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]', - inlined from 'void boost::sort::spin_detail::range_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare, uint32_t) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/spinsort/spinsort.hpp:296:10: -/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 259 | Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, - | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - 260 | dest.first, comp); - | ~~~~~~~~~~~~~~~~~ /usr/include/boost/sort/spinsort/spinsort.hpp: In function 'void boost::sort::spin_detail::sort_range_sort(const boost::sort::common::range&, const boost::sort::common::range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]': /usr/include/boost/sort/spinsort/spinsort.hpp:327:20: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 327 | insert_sort(rng_data.first, rng_data.last, comp); @@ -2139,6 +1959,36 @@ 308 | src2.last, dest.first, comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/sort/common/range.hpp:307:38: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +In function 'boost::sort::common::range boost::sort::common::merge_construct(const range&, const range&, const range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Value_t = veryfasttree::NeighbourJoining::Besthit; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]', + inlined from 'boost::sort::common::range boost::sort::common::uninit_full_merge4(const range&, range*, uint32_t, Compare) [with Value_t = veryfasttree::NeighbourJoining::Besthit; Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_four.hpp:236:31, + inlined from 'void boost::sort::common::uninit_merge_level4(range, std::vector >&, std::vector >&, Compare) [with Value_t = veryfasttree::NeighbourJoining::Besthit; Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_vector.hpp:125:41, + inlined from 'void boost::sort::sample_detail::sample_sort::execute_first() [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/sample_sort/sample_sort.hpp:162:32: +/usr/include/boost/sort/common/range.hpp:284:46: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 284 | Value_t * ptr_aux = util::merge_construct(src1.first, src1.last, src2.first, + | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ + 285 | src2.last, dest.first, comp); + | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/common/range.hpp:284:46: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +In function 'boost::sort::common::range boost::sort::common::merge_construct(const range&, const range&, const range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Value_t = veryfasttree::NeighbourJoining::Besthit; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]', + inlined from 'boost::sort::common::range boost::sort::common::uninit_full_merge4(const range&, range*, uint32_t, Compare) [with Value_t = veryfasttree::NeighbourJoining::Besthit; Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_four.hpp:312:38, + inlined from 'void boost::sort::common::uninit_merge_level4(range, std::vector >&, std::vector >&, Compare) [with Value_t = veryfasttree::NeighbourJoining::Besthit; Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_vector.hpp:125:41, + inlined from 'void boost::sort::sample_detail::sample_sort::execute_first() [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/sample_sort/sample_sort.hpp:162:32: +/usr/include/boost/sort/common/range.hpp:284:46: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 284 | Value_t * ptr_aux = util::merge_construct(src1.first, src1.last, src2.first, + | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ + 285 | src2.last, dest.first, comp); + | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/common/range.hpp:284:46: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +In function 'boost::sort::common::range boost::sort::common::merge_construct(const range&, const range&, const range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Value_t = veryfasttree::NeighbourJoining::Besthit; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]', + inlined from 'boost::sort::common::range boost::sort::common::uninit_full_merge4(const range&, range*, uint32_t, Compare) [with Value_t = veryfasttree::NeighbourJoining::Besthit; Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_four.hpp:318:38, + inlined from 'void boost::sort::common::uninit_merge_level4(range, std::vector >&, std::vector >&, Compare) [with Value_t = veryfasttree::NeighbourJoining::Besthit; Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_vector.hpp:125:41, + inlined from 'void boost::sort::sample_detail::sample_sort::execute_first() [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/sample_sort/sample_sort.hpp:162:32: +/usr/include/boost/sort/common/range.hpp:284:46: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 284 | Value_t * ptr_aux = util::merge_construct(src1.first, src1.last, src2.first, + | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ + 285 | src2.last, dest.first, comp); + | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/common/range.hpp:284:46: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 In constructor 'boost::sort::spin_detail::spinsort::spinsort(Iter_t, Iter_t, Compare, range_buf) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]', inlined from 'boost::sort::sample_detail::sample_sort<__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >, veryfasttree::NeighbourJoining::CompareHitsByCriterion>::initial_configuration()::' at /usr/include/boost/sort/sample_sort/sample_sort.hpp:378:18, inlined from 'constexpr _Res std::__invoke_impl(__invoke_other, _Fn&&, _Args&& ...) [with _Res = void; _Fn = boost::sort::sample_detail::sample_sort<__gnu_cxx::__normal_iterator::Besthit*, vector::Besthit, allocator::Besthit> > >, veryfasttree::NeighbourJoining::CompareHitsByCriterion>::initial_configuration()::; _Args = {}]' at /usr/include/c++/14/bits/invoke.h:61:36, @@ -2212,16 +2062,69 @@ 285 | src2.last, dest.first, comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/sort/common/range.hpp:284:46: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -/usr/include/boost/sort/sample_sort/sample_sort.hpp: In constructor 'boost::sort::sample_detail::sample_sort::sample_sort(Iter_t, Iter_t, Compare, uint32_t, value_t*, size_t) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]': -/usr/include/boost/sort/sample_sort/sample_sort.hpp:239:1: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 239 | sample_sort - | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/sample_sort/sample_sort.hpp:239:1: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -In constructor 'boost::sort::spin_detail::spinsort::spinsort(Iter_t, Iter_t, Compare) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]', - inlined from 'boost::sort::sample_detail::sample_sort::sample_sort(Iter_t, Iter_t, Compare, uint32_t, value_t*, size_t) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/sample_sort/sample_sort.hpp:260:14: -/usr/include/boost/sort/spinsort/spinsort.hpp:403:45: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 403 | : spinsort(first, last, comp, nullptr, 0) { }; - | ^ +In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter3_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]', + inlined from 'boost::sort::common::range boost::sort::common::full_merge4(const range&, range*, uint32_t, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/common/merge_four.hpp:107:21, + inlined from 'void boost::sort::common::merge_level4(range, std::vector >&, std::vector >&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/common/merge_vector.hpp:78:34, + inlined from 'boost::sort::common::range boost::sort::common::merge_vector4(range, range, std::vector >&, std::vector >&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/common/merge_vector.hpp:178:25, + inlined from 'void boost::sort::sample_detail::sample_sort::execute() [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/sample_sort/sample_sort.hpp:176:26: +/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 259 | Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, + | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ + 260 | dest.first, comp); + | ~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter3_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]', + inlined from 'boost::sort::common::range boost::sort::common::full_merge4(const range&, range*, uint32_t, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/common/merge_four.hpp:184:34, + inlined from 'void boost::sort::common::merge_level4(range, std::vector >&, std::vector >&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/common/merge_vector.hpp:78:34, + inlined from 'boost::sort::common::range boost::sort::common::merge_vector4(range, range, std::vector >&, std::vector >&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/common/merge_vector.hpp:178:25, + inlined from 'void boost::sort::sample_detail::sample_sort::execute() [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/sample_sort/sample_sort.hpp:176:26: +/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 259 | Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, + | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ + 260 | dest.first, comp); + | ~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter3_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]', + inlined from 'boost::sort::common::range boost::sort::common::full_merge4(const range&, range*, uint32_t, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/common/merge_four.hpp:189:36, + inlined from 'void boost::sort::common::merge_level4(range, std::vector >&, std::vector >&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/common/merge_vector.hpp:78:34, + inlined from 'boost::sort::common::range boost::sort::common::merge_vector4(range, range, std::vector >&, std::vector >&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/common/merge_vector.hpp:178:25, + inlined from 'void boost::sort::sample_detail::sample_sort::execute() [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/sample_sort/sample_sort.hpp:176:26: +/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 259 | Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, + | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ + 260 | dest.first, comp); + | ~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Iter3_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]', + inlined from 'boost::sort::common::range boost::sort::common::full_merge4(const range&, range*, uint32_t, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/common/merge_four.hpp:107:21, + inlined from 'void boost::sort::common::merge_level4(range, std::vector >&, std::vector >&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/common/merge_vector.hpp:78:34, + inlined from 'boost::sort::common::range boost::sort::common::merge_vector4(range, range, std::vector >&, std::vector >&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/common/merge_vector.hpp:184:25, + inlined from 'void boost::sort::sample_detail::sample_sort::execute() [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/sample_sort/sample_sort.hpp:176:26: +/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 259 | Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, + | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ + 260 | dest.first, comp); + | ~~~~~~~~~~~~~~~~~ +In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Iter3_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]', + inlined from 'boost::sort::common::range boost::sort::common::full_merge4(const range&, range*, uint32_t, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/common/merge_four.hpp:184:34, + inlined from 'void boost::sort::common::merge_level4(range, std::vector >&, std::vector >&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/common/merge_vector.hpp:78:34, + inlined from 'boost::sort::common::range boost::sort::common::merge_vector4(range, range, std::vector >&, std::vector >&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/common/merge_vector.hpp:184:25, + inlined from 'void boost::sort::sample_detail::sample_sort::execute() [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/sample_sort/sample_sort.hpp:176:26: +/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 259 | Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, + | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ + 260 | dest.first, comp); + | ~~~~~~~~~~~~~~~~~ +In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Iter3_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]', + inlined from 'boost::sort::common::range boost::sort::common::full_merge4(const range&, range*, uint32_t, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/common/merge_four.hpp:189:36, + inlined from 'void boost::sort::common::merge_level4(range, std::vector >&, std::vector >&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/common/merge_vector.hpp:78:34, + inlined from 'boost::sort::common::range boost::sort::common::merge_vector4(range, range, std::vector >&, std::vector >&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/common/merge_vector.hpp:184:25, + inlined from 'void boost::sort::sample_detail::sample_sort::execute() [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/sample_sort/sample_sort.hpp:176:26: +/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 259 | Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, + | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ + 260 | dest.first, comp); + | ~~~~~~~~~~~~~~~~~ In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter3_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]', inlined from 'boost::sort::common::range boost::sort::common::full_merge4(const range&, range*, uint32_t, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/common/merge_four.hpp:107:21, inlined from 'void boost::sort::common::merge_level4(range, std::vector >&, std::vector >&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/common/merge_vector.hpp:78:34, @@ -2285,42 +2188,69 @@ | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 260 | dest.first, comp); | ~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp: In constructor 'boost::sort::stable_detail::parallel_stable_sort::parallel_stable_sort(Iter_t, Iter_t, Compare, uint32_t) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]': -/usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:124:1: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 124 | parallel_stable_sort - | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:124:1: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -In constructor 'boost::sort::spin_detail::spinsort::spinsort(Iter_t, Iter_t, Compare) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]', - inlined from 'boost::sort::stable_detail::parallel_stable_sort::parallel_stable_sort(Iter_t, Iter_t, Compare, uint32_t) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:136:14: -/usr/include/boost/sort/spinsort/spinsort.hpp:403:45: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 403 | : spinsort(first, last, comp, nullptr, 0) { }; - | ^ -In constructor 'boost::sort::sample_detail::sample_sort::sample_sort(Iter_t, Iter_t, Compare, uint32_t, range_buf) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]', - inlined from 'boost::sort::stable_detail::parallel_stable_sort::parallel_stable_sort(Iter_t, Iter_t, Compare, uint32_t) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:176:9: -/usr/include/boost/sort/sample_sort/sample_sort.hpp:142:68: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 142 | range_buf_initial.first, range_buf_initial.size()) { }; - | ^ -In constructor 'boost::sort::sample_detail::sample_sort::sample_sort(Iter_t, Iter_t, Compare, uint32_t, range_buf) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]', - inlined from 'boost::sort::stable_detail::parallel_stable_sort::parallel_stable_sort(Iter_t, Iter_t, Compare, uint32_t) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:187:9: -/usr/include/boost/sort/sample_sort/sample_sort.hpp:142:68: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 142 | range_buf_initial.first, range_buf_initial.size()) { }; - | ^ -In function 'boost::sort::common::range boost::sort::common::merge_half(const range&, const range&, const range&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]', - inlined from 'boost::sort::stable_detail::parallel_stable_sort::parallel_stable_sort(Iter_t, Iter_t, Compare, uint32_t) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:197:31: -/usr/include/boost/sort/common/range.hpp:307:38: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 307 | Iter2_t it_aux = util::merge_half(src1.first, src1.last, src2.first, - | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - 308 | src2.last, dest.first, comp); - | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/common/range.hpp:307:38: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -In function 'void boost::sort::parallel_stable_sort(Iter_t, Iter_t, Compare, uint32_t) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]', - inlined from 'void veryfasttree::psort(Iter, Iter, const Compare&, bool) [with Iter = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = NeighbourJoining::CompareHitsByIJ]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../Utils.h:145:42, - inlined from '_ZN12veryfasttree16NeighbourJoiningIdNS_15BasicOperationsEE14uniqueBestHitsExRSt6vectorINS2_7BesthitESaIS4_EES7_._omp_fn.0' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:4797:18: -/usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:291:20: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 291 | stable_detail::parallel_stable_sort - | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - 292 | (first, last, comp, nthread); - | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter3_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]', + inlined from 'boost::sort::common::range boost::sort::common::full_merge4(const range&, range*, uint32_t, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_four.hpp:107:21, + inlined from 'void boost::sort::common::merge_level4(range, std::vector >&, std::vector >&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_vector.hpp:78:34, + inlined from 'boost::sort::common::range boost::sort::common::merge_vector4(range, range, std::vector >&, std::vector >&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_vector.hpp:178:25, + inlined from 'void boost::sort::sample_detail::sample_sort::execute() [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/sample_sort/sample_sort.hpp:176:26: +/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 259 | Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, + | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ + 260 | dest.first, comp); + | ~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter3_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]', + inlined from 'boost::sort::common::range boost::sort::common::full_merge4(const range&, range*, uint32_t, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_four.hpp:184:34, + inlined from 'void boost::sort::common::merge_level4(range, std::vector >&, std::vector >&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_vector.hpp:78:34, + inlined from 'boost::sort::common::range boost::sort::common::merge_vector4(range, range, std::vector >&, std::vector >&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_vector.hpp:178:25, + inlined from 'void boost::sort::sample_detail::sample_sort::execute() [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/sample_sort/sample_sort.hpp:176:26: +/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 259 | Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, + | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ + 260 | dest.first, comp); + | ~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter3_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]', + inlined from 'boost::sort::common::range boost::sort::common::full_merge4(const range&, range*, uint32_t, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_four.hpp:189:36, + inlined from 'void boost::sort::common::merge_level4(range, std::vector >&, std::vector >&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_vector.hpp:78:34, + inlined from 'boost::sort::common::range boost::sort::common::merge_vector4(range, range, std::vector >&, std::vector >&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_vector.hpp:178:25, + inlined from 'void boost::sort::sample_detail::sample_sort::execute() [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/sample_sort/sample_sort.hpp:176:26: +/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 259 | Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, + | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ + 260 | dest.first, comp); + | ~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Iter3_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]', + inlined from 'boost::sort::common::range boost::sort::common::full_merge4(const range&, range*, uint32_t, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_four.hpp:107:21, + inlined from 'void boost::sort::common::merge_level4(range, std::vector >&, std::vector >&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_vector.hpp:78:34, + inlined from 'boost::sort::common::range boost::sort::common::merge_vector4(range, range, std::vector >&, std::vector >&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_vector.hpp:184:25, + inlined from 'void boost::sort::sample_detail::sample_sort::execute() [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/sample_sort/sample_sort.hpp:176:26: +/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 259 | Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, + | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ + 260 | dest.first, comp); + | ~~~~~~~~~~~~~~~~~ +In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Iter3_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]', + inlined from 'boost::sort::common::range boost::sort::common::full_merge4(const range&, range*, uint32_t, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_four.hpp:184:34, + inlined from 'void boost::sort::common::merge_level4(range, std::vector >&, std::vector >&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_vector.hpp:78:34, + inlined from 'boost::sort::common::range boost::sort::common::merge_vector4(range, range, std::vector >&, std::vector >&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_vector.hpp:184:25, + inlined from 'void boost::sort::sample_detail::sample_sort::execute() [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/sample_sort/sample_sort.hpp:176:26: +/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 259 | Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, + | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ + 260 | dest.first, comp); + | ~~~~~~~~~~~~~~~~~ +In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Iter3_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]', + inlined from 'boost::sort::common::range boost::sort::common::full_merge4(const range&, range*, uint32_t, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_four.hpp:189:36, + inlined from 'void boost::sort::common::merge_level4(range, std::vector >&, std::vector >&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_vector.hpp:78:34, + inlined from 'boost::sort::common::range boost::sort::common::merge_vector4(range, range, std::vector >&, std::vector >&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_vector.hpp:184:25, + inlined from 'void boost::sort::sample_detail::sample_sort::execute() [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/sample_sort/sample_sort.hpp:176:26: +/usr/include/boost/sort/common/range.hpp:259:33: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 259 | Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, + | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ + 260 | dest.first, comp); + | ~~~~~~~~~~~~~~~~~ In function 'boost::sort::common::range boost::sort::common::merge(const range&, const range&, const range&, Compare) [with Iter1_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Iter3_t = veryfasttree::NeighbourJoining::Besthit*; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]', inlined from 'boost::sort::common::range boost::sort::common::full_merge4(const range&, range*, uint32_t, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_four.hpp:107:21, inlined from 'void boost::sort::common::merge_level4(range, std::vector >&, std::vector >&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/common/merge_vector.hpp:78:34, @@ -2384,60 +2314,44 @@ | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 260 | dest.first, comp); | ~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/sample_sort/sample_sort.hpp: In constructor 'boost::sort::sample_detail::sample_sort::sample_sort(Iter_t, Iter_t, Compare, uint32_t, value_t*, size_t) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]': -/usr/include/boost/sort/sample_sort/sample_sort.hpp:239:1: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +/usr/include/boost/sort/sample_sort/sample_sort.hpp: In constructor 'boost::sort::sample_detail::sample_sort::sample_sort(Iter_t, Iter_t, Compare, uint32_t, value_t*, size_t) [with Iter_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]': +/usr/include/boost/sort/sample_sort/sample_sort.hpp:239:1: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 239 | sample_sort | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/sample_sort/sample_sort.hpp:239:1: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -In constructor 'boost::sort::spin_detail::spinsort::spinsort(Iter_t, Iter_t, Compare) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]', - inlined from 'boost::sort::sample_detail::sample_sort::sample_sort(Iter_t, Iter_t, Compare, uint32_t, value_t*, size_t) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/sample_sort/sample_sort.hpp:260:14: -/usr/include/boost/sort/spinsort/spinsort.hpp:403:45: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +/usr/include/boost/sort/sample_sort/sample_sort.hpp:239:1: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 +In constructor 'boost::sort::spin_detail::spinsort::spinsort(Iter_t, Iter_t, Compare) [with Iter_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]', + inlined from 'boost::sort::sample_detail::sample_sort::sample_sort(Iter_t, Iter_t, Compare, uint32_t, value_t*, size_t) [with Iter_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]' at /usr/include/boost/sort/sample_sort/sample_sort.hpp:260:14: +/usr/include/boost/sort/spinsort/spinsort.hpp:403:45: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 403 | : spinsort(first, last, comp, nullptr, 0) { }; | ^ -/usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp: In constructor 'boost::sort::stable_detail::parallel_stable_sort::parallel_stable_sort(Iter_t, Iter_t, Compare, uint32_t) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]': -/usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:124:1: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +/usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp: In constructor 'boost::sort::stable_detail::parallel_stable_sort::parallel_stable_sort(Iter_t, Iter_t, Compare, uint32_t) [with Iter_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]': +/usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:124:1: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 124 | parallel_stable_sort | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:124:1: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -In constructor 'boost::sort::spin_detail::spinsort::spinsort(Iter_t, Iter_t, Compare) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]', - inlined from 'boost::sort::stable_detail::parallel_stable_sort::parallel_stable_sort(Iter_t, Iter_t, Compare, uint32_t) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:136:14: -/usr/include/boost/sort/spinsort/spinsort.hpp:403:45: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +/usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:124:1: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 +In constructor 'boost::sort::spin_detail::spinsort::spinsort(Iter_t, Iter_t, Compare) [with Iter_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]', + inlined from 'boost::sort::stable_detail::parallel_stable_sort::parallel_stable_sort(Iter_t, Iter_t, Compare, uint32_t) [with Iter_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]' at /usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:136:14: +/usr/include/boost/sort/spinsort/spinsort.hpp:403:45: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 403 | : spinsort(first, last, comp, nullptr, 0) { }; | ^ -In constructor 'boost::sort::sample_detail::sample_sort::sample_sort(Iter_t, Iter_t, Compare, uint32_t, range_buf) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]', - inlined from 'boost::sort::stable_detail::parallel_stable_sort::parallel_stable_sort(Iter_t, Iter_t, Compare, uint32_t) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:176:9: -/usr/include/boost/sort/sample_sort/sample_sort.hpp:142:68: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +In constructor 'boost::sort::sample_detail::sample_sort::sample_sort(Iter_t, Iter_t, Compare, uint32_t, range_buf) [with Iter_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]', + inlined from 'boost::sort::stable_detail::parallel_stable_sort::parallel_stable_sort(Iter_t, Iter_t, Compare, uint32_t) [with Iter_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]' at /usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:176:9: +/usr/include/boost/sort/sample_sort/sample_sort.hpp:142:68: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 142 | range_buf_initial.first, range_buf_initial.size()) { }; | ^ -In constructor 'boost::sort::sample_detail::sample_sort::sample_sort(Iter_t, Iter_t, Compare, uint32_t, range_buf) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]', - inlined from 'boost::sort::stable_detail::parallel_stable_sort::parallel_stable_sort(Iter_t, Iter_t, Compare, uint32_t) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:187:9: -/usr/include/boost/sort/sample_sort/sample_sort.hpp:142:68: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +In constructor 'boost::sort::sample_detail::sample_sort::sample_sort(Iter_t, Iter_t, Compare, uint32_t, range_buf) [with Iter_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]', + inlined from 'boost::sort::stable_detail::parallel_stable_sort::parallel_stable_sort(Iter_t, Iter_t, Compare, uint32_t) [with Iter_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]' at /usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:187:9: +/usr/include/boost/sort/sample_sort/sample_sort.hpp:142:68: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 142 | range_buf_initial.first, range_buf_initial.size()) { }; | ^ -In function 'boost::sort::common::range boost::sort::common::merge_half(const range&, const range&, const range&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]', - inlined from 'boost::sort::stable_detail::parallel_stable_sort::parallel_stable_sort(Iter_t, Iter_t, Compare, uint32_t) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:197:31: -/usr/include/boost/sort/common/range.hpp:307:38: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +In function 'boost::sort::common::range boost::sort::common::merge_half(const range&, const range&, const range&, Compare) [with Iter1_t = long long int*; Iter2_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]', + inlined from 'boost::sort::stable_detail::parallel_stable_sort::parallel_stable_sort(Iter_t, Iter_t, Compare, uint32_t) [with Iter_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]' at /usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:197:31: +/usr/include/boost/sort/common/range.hpp:307:38: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 307 | Iter2_t it_aux = util::merge_half(src1.first, src1.last, src2.first, | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 308 | src2.last, dest.first, comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -/usr/include/boost/sort/common/range.hpp:307:38: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 -In function 'void boost::sort::parallel_stable_sort(Iter_t, Iter_t, Compare, uint32_t) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]', - inlined from 'void veryfasttree::psort(Iter, Iter, const Compare&, bool) [with Iter = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = NeighbourJoining::CompareHitsByCriterion]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../Utils.h:145:42, - inlined from 'void veryfasttree::NeighbourJoining::sortSaveBestHits(int64_t, std::vector&, int64_t, int64_t, TopHits&, bool) [with Precision = double; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:4541:14: -/usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:291:20: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 291 | stable_detail::parallel_stable_sort - | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - 292 | (first, last, comp, nthread); - | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -In function 'void boost::sort::parallel_stable_sort(Iter_t, Iter_t, Compare, uint32_t) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]', - inlined from 'void veryfasttree::psort(Iter, Iter, const Compare&, bool) [with Iter = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = NeighbourJoining::CompareHitsByCriterion]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../Utils.h:145:42, - inlined from '_ZN12veryfasttree16NeighbourJoiningIdNS_15BasicOperationsEE17setAllLeafTopHitsERNS2_7TopHitsE._omp_fn.0' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:3810:26: -/usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:291:20: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 291 | stable_detail::parallel_stable_sort - | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - 292 | (first, last, comp, nthread); - | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/common/range.hpp:307:38: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator >' changed in GCC 7.1 /usr/include/boost/sort/sample_sort/sample_sort.hpp: In constructor 'boost::sort::sample_detail::sample_sort::sample_sort(Iter_t, Iter_t, Compare, uint32_t, value_t*, size_t) [with Iter_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]': /usr/include/boost/sort/sample_sort/sample_sort.hpp:239:1: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 239 | sample_sort @@ -2448,6 +2362,28 @@ /usr/include/boost/sort/spinsort/spinsort.hpp:403:45: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 403 | : spinsort(first, last, comp, nullptr, 0) { }; | ^ +In function 'void boost::sort::parallel_stable_sort(Iter_t, Iter_t, Compare, uint32_t) [with Iter_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]', + inlined from 'void veryfasttree::psort(Iter, Iter, const Compare&, bool) [with Iter = __gnu_cxx::__normal_iterator >; Compare = NeighbourJoining::CompareSeeds]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../Utils.h:145:42, + inlined from 'void veryfasttree::NeighbourJoining::setAllLeafTopHits(TopHits&) [with Precision = double; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:3770:10: +/usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:291:20: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 + 291 | stable_detail::parallel_stable_sort + | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ + 292 | (first, last, comp, nthread); + | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +In static member function 'static _ForwardIterator std::__uninitialized_copy<_TrivialValueTypes>::__uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator::TopHitsList*, std::vector::TopHitsList, std::allocator::TopHitsList> > >; _ForwardIterator = veryfasttree::NeighbourJoining::TopHitsList*; bool _TrivialValueTypes = false]', + inlined from '_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator::TopHitsList*, vector::TopHitsList, allocator::TopHitsList> > >; _ForwardIterator = veryfasttree::NeighbourJoining::TopHitsList*]' at /usr/include/c++/14/bits/stl_uninitialized.h:185:15, + inlined from '_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = __gnu_cxx::__normal_iterator::TopHitsList*, vector::TopHitsList, allocator::TopHitsList> > >; _ForwardIterator = veryfasttree::NeighbourJoining::TopHitsList*; _Tp = veryfasttree::NeighbourJoining::TopHitsList]' at /usr/include/c++/14/bits/stl_uninitialized.h:373:37, + inlined from 'std::vector<_Tp, _Alloc>::vector(const std::vector<_Tp, _Alloc>&) [with _Tp = veryfasttree::NeighbourJoining::TopHitsList; _Alloc = std::allocator::TopHitsList>]' at /usr/include/c++/14/bits/stl_vector.h:606:31, + inlined from 'veryfasttree::NeighbourJoining::TopHits::TopHits(const veryfasttree::NeighbourJoining::TopHits&)' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.h:224:16, + inlined from 'void veryfasttree::NeighbourJoining::setAllLeafTopHits(TopHits&) [with Precision = double; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:3886:21: +/usr/include/c++/14/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::TopHitsList*, std::vector::TopHitsList, std::allocator::TopHitsList> > >' changed in GCC 7.1 + 137 | { return std::__do_uninit_copy(__first, __last, __result); } + | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ +In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = veryfasttree::NeighbourJoining::TopHits; _Alloc = std::allocator::TopHits>]', + inlined from 'void veryfasttree::NeighbourJoining::setAllLeafTopHits(TopHits&) [with Precision = double; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:3889:33: +/usr/include/c++/14/bits/stl_vector.h:1037:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::TopHits*, std::vector::TopHits, std::allocator::TopHits> > >' changed in GCC 7.1 + 1037 | _M_fill_insert(end(), __new_size - size(), __x); + | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp: In constructor 'boost::sort::stable_detail::parallel_stable_sort::parallel_stable_sort(Iter_t, Iter_t, Compare, uint32_t) [with Iter_t = __gnu_cxx::__normal_iterator >; Compare = veryfasttree::NeighbourJoining::CompareSeeds]': /usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:124:1: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 124 | parallel_stable_sort @@ -2498,17 +2434,47 @@ /usr/include/c++/14/bits/stl_vector.h:1037:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::TopHits*, std::vector::TopHits, std::allocator::TopHits> > >' changed in GCC 7.1 1037 | _M_fill_insert(end(), __new_size - size(), __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -In function 'void boost::sort::parallel_stable_sort(Iter_t, Iter_t, Compare, uint32_t) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]', - inlined from 'void veryfasttree::psort(Iter, Iter, const Compare&, bool) [with Iter = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = NeighbourJoining::CompareHitsByCriterion]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../Utils.h:145:42, - inlined from 'void veryfasttree::NeighbourJoining::resetTopVisible(int64_t, TopHits&) [with Precision = double; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:4744:10: -/usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:291:20: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 - 291 | stable_detail::parallel_stable_sort - | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - 292 | (first, last, comp, nthread); - | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -In function 'void boost::sort::parallel_stable_sort(Iter_t, Iter_t, Compare, uint32_t) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]', - inlined from 'void veryfasttree::psort(Iter, Iter, const Compare&, bool) [with Iter = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = NeighbourJoining::CompareHitsByCriterion]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../Utils.h:145:42, - inlined from 'void veryfasttree::NeighbourJoining::topHitJoin(int64_t, int64_t, TopHits&) [with Precision = double; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:4471:14: +/usr/include/boost/sort/sample_sort/sample_sort.hpp: In constructor 'boost::sort::sample_detail::sample_sort::sample_sort(Iter_t, Iter_t, Compare, uint32_t, value_t*, size_t) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]': +/usr/include/boost/sort/sample_sort/sample_sort.hpp:239:1: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 239 | sample_sort + | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/sample_sort/sample_sort.hpp:239:1: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +In constructor 'boost::sort::spin_detail::spinsort::spinsort(Iter_t, Iter_t, Compare) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]', + inlined from 'boost::sort::sample_detail::sample_sort::sample_sort(Iter_t, Iter_t, Compare, uint32_t, value_t*, size_t) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/sample_sort/sample_sort.hpp:260:14: +/usr/include/boost/sort/spinsort/spinsort.hpp:403:45: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 403 | : spinsort(first, last, comp, nullptr, 0) { }; + | ^ +/usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp: In constructor 'boost::sort::stable_detail::parallel_stable_sort::parallel_stable_sort(Iter_t, Iter_t, Compare, uint32_t) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]': +/usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:124:1: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 124 | parallel_stable_sort + | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:124:1: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +In constructor 'boost::sort::spin_detail::spinsort::spinsort(Iter_t, Iter_t, Compare) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]', + inlined from 'boost::sort::stable_detail::parallel_stable_sort::parallel_stable_sort(Iter_t, Iter_t, Compare, uint32_t) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:136:14: +/usr/include/boost/sort/spinsort/spinsort.hpp:403:45: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 403 | : spinsort(first, last, comp, nullptr, 0) { }; + | ^ +In constructor 'boost::sort::sample_detail::sample_sort::sample_sort(Iter_t, Iter_t, Compare, uint32_t, range_buf) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]', + inlined from 'boost::sort::stable_detail::parallel_stable_sort::parallel_stable_sort(Iter_t, Iter_t, Compare, uint32_t) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:176:9: +/usr/include/boost/sort/sample_sort/sample_sort.hpp:142:68: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 142 | range_buf_initial.first, range_buf_initial.size()) { }; + | ^ +In constructor 'boost::sort::sample_detail::sample_sort::sample_sort(Iter_t, Iter_t, Compare, uint32_t, range_buf) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]', + inlined from 'boost::sort::stable_detail::parallel_stable_sort::parallel_stable_sort(Iter_t, Iter_t, Compare, uint32_t) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:187:9: +/usr/include/boost/sort/sample_sort/sample_sort.hpp:142:68: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 142 | range_buf_initial.first, range_buf_initial.size()) { }; + | ^ +In function 'boost::sort::common::range boost::sort::common::merge_half(const range&, const range&, const range&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]', + inlined from 'boost::sort::stable_detail::parallel_stable_sort::parallel_stable_sort(Iter_t, Iter_t, Compare, uint32_t) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]' at /usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:197:31: +/usr/include/boost/sort/common/range.hpp:307:38: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 307 | Iter2_t it_aux = util::merge_half(src1.first, src1.last, src2.first, + | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ + 308 | src2.last, dest.first, comp); + | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/common/range.hpp:307:38: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +In function 'void boost::sort::parallel_stable_sort(Iter_t, Iter_t, Compare, uint32_t) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByIJ]', + inlined from 'void veryfasttree::psort(Iter, Iter, const Compare&, bool) [with Iter = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = NeighbourJoining::CompareHitsByIJ]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../Utils.h:145:42, + inlined from '_ZN12veryfasttree16NeighbourJoiningIdNS_15BasicOperationsEE14uniqueBestHitsExRSt6vectorINS2_7BesthitESaIS4_EES7_._omp_fn.0' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:4797:18: /usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:291:20: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 291 | stable_detail::parallel_stable_sort | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ @@ -2560,6 +2526,60 @@ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 292 | (first, last, comp, nthread); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/sample_sort/sample_sort.hpp: In constructor 'boost::sort::sample_detail::sample_sort::sample_sort(Iter_t, Iter_t, Compare, uint32_t, value_t*, size_t) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]': +/usr/include/boost/sort/sample_sort/sample_sort.hpp:239:1: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 239 | sample_sort + | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/sample_sort/sample_sort.hpp:239:1: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +In constructor 'boost::sort::spin_detail::spinsort::spinsort(Iter_t, Iter_t, Compare) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]', + inlined from 'boost::sort::sample_detail::sample_sort::sample_sort(Iter_t, Iter_t, Compare, uint32_t, value_t*, size_t) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/sample_sort/sample_sort.hpp:260:14: +/usr/include/boost/sort/spinsort/spinsort.hpp:403:45: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 403 | : spinsort(first, last, comp, nullptr, 0) { }; + | ^ +/usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp: In constructor 'boost::sort::stable_detail::parallel_stable_sort::parallel_stable_sort(Iter_t, Iter_t, Compare, uint32_t) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]': +/usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:124:1: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 124 | parallel_stable_sort + | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:124:1: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +In constructor 'boost::sort::spin_detail::spinsort::spinsort(Iter_t, Iter_t, Compare) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]', + inlined from 'boost::sort::stable_detail::parallel_stable_sort::parallel_stable_sort(Iter_t, Iter_t, Compare, uint32_t) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:136:14: +/usr/include/boost/sort/spinsort/spinsort.hpp:403:45: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 403 | : spinsort(first, last, comp, nullptr, 0) { }; + | ^ +In constructor 'boost::sort::sample_detail::sample_sort::sample_sort(Iter_t, Iter_t, Compare, uint32_t, range_buf) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]', + inlined from 'boost::sort::stable_detail::parallel_stable_sort::parallel_stable_sort(Iter_t, Iter_t, Compare, uint32_t) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:176:9: +/usr/include/boost/sort/sample_sort/sample_sort.hpp:142:68: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 142 | range_buf_initial.first, range_buf_initial.size()) { }; + | ^ +In constructor 'boost::sort::sample_detail::sample_sort::sample_sort(Iter_t, Iter_t, Compare, uint32_t, range_buf) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]', + inlined from 'boost::sort::stable_detail::parallel_stable_sort::parallel_stable_sort(Iter_t, Iter_t, Compare, uint32_t) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:187:9: +/usr/include/boost/sort/sample_sort/sample_sort.hpp:142:68: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 142 | range_buf_initial.first, range_buf_initial.size()) { }; + | ^ +In function 'boost::sort::common::range boost::sort::common::merge_half(const range&, const range&, const range&, Compare) [with Iter1_t = veryfasttree::NeighbourJoining::Besthit*; Iter2_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]', + inlined from 'boost::sort::stable_detail::parallel_stable_sort::parallel_stable_sort(Iter_t, Iter_t, Compare, uint32_t) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]' at /usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:197:31: +/usr/include/boost/sort/common/range.hpp:307:38: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 307 | Iter2_t it_aux = util::merge_half(src1.first, src1.last, src2.first, + | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ + 308 | src2.last, dest.first, comp); + | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +/usr/include/boost/sort/common/range.hpp:307:38: note: parameter passing for argument of type 'const __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 +In function 'void boost::sort::parallel_stable_sort(Iter_t, Iter_t, Compare, uint32_t) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]', + inlined from 'void veryfasttree::psort(Iter, Iter, const Compare&, bool) [with Iter = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = NeighbourJoining::CompareHitsByCriterion]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../Utils.h:145:42, + inlined from 'void veryfasttree::NeighbourJoining::sortSaveBestHits(int64_t, std::vector&, int64_t, int64_t, TopHits&, bool) [with Precision = double; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:4541:14: +/usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:291:20: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 291 | stable_detail::parallel_stable_sort + | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ + 292 | (first, last, comp, nthread); + | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +In function 'void boost::sort::parallel_stable_sort(Iter_t, Iter_t, Compare, uint32_t) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]', + inlined from 'void veryfasttree::psort(Iter, Iter, const Compare&, bool) [with Iter = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = NeighbourJoining::CompareHitsByCriterion]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../Utils.h:145:42, + inlined from '_ZN12veryfasttree16NeighbourJoiningIdNS_15BasicOperationsEE17setAllLeafTopHitsERNS2_7TopHitsE._omp_fn.0' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:3810:26: +/usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:291:20: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 291 | stable_detail::parallel_stable_sort + | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ + 292 | (first, last, comp, nthread); + | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/sort/sample_sort/sample_sort.hpp: In constructor 'boost::sort::sample_detail::sample_sort::sample_sort(Iter_t, Iter_t, Compare, uint32_t, value_t*, size_t) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]': /usr/include/boost/sort/sample_sort/sample_sort.hpp:239:1: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 239 | sample_sort @@ -2614,6 +2634,22 @@ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 292 | (first, last, comp, nthread); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +In function 'void boost::sort::parallel_stable_sort(Iter_t, Iter_t, Compare, uint32_t) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]', + inlined from 'void veryfasttree::psort(Iter, Iter, const Compare&, bool) [with Iter = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = NeighbourJoining::CompareHitsByCriterion]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../Utils.h:145:42, + inlined from 'void veryfasttree::NeighbourJoining::resetTopVisible(int64_t, TopHits&) [with Precision = double; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:4744:10: +/usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:291:20: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 291 | stable_detail::parallel_stable_sort + | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ + 292 | (first, last, comp, nthread); + | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +In function 'void boost::sort::parallel_stable_sort(Iter_t, Iter_t, Compare, uint32_t) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]', + inlined from 'void veryfasttree::psort(Iter, Iter, const Compare&, bool) [with Iter = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = NeighbourJoining::CompareHitsByCriterion]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../Utils.h:145:42, + inlined from 'void veryfasttree::NeighbourJoining::topHitJoin(int64_t, int64_t, TopHits&) [with Precision = double; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:4471:14: +/usr/include/boost/sort/parallel_stable_sort/parallel_stable_sort.hpp:291:20: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >' changed in GCC 7.1 + 291 | stable_detail::parallel_stable_sort + | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ + 292 | (first, last, comp, nthread); + | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void boost::sort::parallel_stable_sort(Iter_t, Iter_t, Compare, uint32_t) [with Iter_t = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = veryfasttree::NeighbourJoining::CompareHitsByCriterion]', inlined from 'void veryfasttree::psort(Iter, Iter, const Compare&, bool) [with Iter = __gnu_cxx::__normal_iterator::Besthit*, std::vector::Besthit, std::allocator::Besthit> > >; Compare = NeighbourJoining::CompareHitsByCriterion]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../Utils.h:145:42, inlined from 'void veryfasttree::NeighbourJoining::resetTopVisible(int64_t, TopHits&) [with Precision = float; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:4744:10: @@ -2645,7 +2681,7 @@ debian/rules override_dh_auto_install make[1]: Entering directory '/build/reproducible-path/veryfasttree-4.0.4+dfsg' dh_auto_install - cd obj-arm-linux-gnueabihf && make -j5 install DESTDIR=/build/reproducible-path/veryfasttree-4.0.4\+dfsg/debian/veryfasttree AM_UPDATE_INFO_DIR=no "INSTALL=install --strip-program=true" + cd obj-arm-linux-gnueabihf && make -j4 install DESTDIR=/build/reproducible-path/veryfasttree-4.0.4\+dfsg/debian/veryfasttree AM_UPDATE_INFO_DIR=no "INSTALL=install --strip-program=true" make[2]: Entering directory '/build/reproducible-path/veryfasttree-4.0.4+dfsg/obj-arm-linux-gnueabihf' /usr/bin/cmake -S/build/reproducible-path/veryfasttree-4.0.4+dfsg -B/build/reproducible-path/veryfasttree-4.0.4+dfsg/obj-arm-linux-gnueabihf --check-build-system CMakeFiles/Makefile.cmake 0 make -f CMakeFiles/Makefile2 preinstall @@ -2680,8 +2716,8 @@ dh_gencontrol dh_md5sums dh_builddeb -dpkg-deb: building package 'veryfasttree-dbgsym' in '../veryfasttree-dbgsym_4.0.4+dfsg-1_armhf.deb'. dpkg-deb: building package 'veryfasttree' in '../veryfasttree_4.0.4+dfsg-1_armhf.deb'. +dpkg-deb: building package 'veryfasttree-dbgsym' in '../veryfasttree-dbgsym_4.0.4+dfsg-1_armhf.deb'. dpkg-genbuildinfo --build=binary -O../veryfasttree_4.0.4+dfsg-1_armhf.buildinfo dpkg-genchanges --build=binary -O../veryfasttree_4.0.4+dfsg-1_armhf.changes dpkg-genchanges: info: binary-only upload (no source code included) @@ -2689,12 +2725,14 @@ dpkg-buildpackage: info: binary-only upload (no source included) dpkg-genchanges: info: including full source code in upload I: copying local configuration +I: user script /srv/workspace/pbuilder/29151/tmp/hooks/B01_cleanup starting +I: user script /srv/workspace/pbuilder/29151/tmp/hooks/B01_cleanup finished I: unmounting dev/ptmx filesystem I: unmounting dev/pts filesystem I: unmounting dev/shm filesystem I: unmounting proc filesystem I: unmounting sys filesystem I: cleaning the build env -I: removing directory /srv/workspace/pbuilder/29534 and its subdirectories -I: Current time: Tue Nov 12 19:02:55 -12 2024 -I: pbuilder-time-stamp: 1731481375 +I: removing directory /srv/workspace/pbuilder/29151 and its subdirectories +I: Current time: Wed Nov 13 21:10:28 +14 2024 +I: pbuilder-time-stamp: 1731481828