Wed Nov 13 06:52:24 UTC 2024 I: starting to build veryfasttree/trixie/armhf on jenkins on '2024-11-13 06:51' Wed Nov 13 06:52:24 UTC 2024 I: The jenkins build log is/was available at https://jenkins.debian.net/userContent/reproducible/debian/build_service/armhf_18/8468/console.log Wed Nov 13 06:52:24 UTC 2024 I: Downloading source for trixie/veryfasttree=4.0.4+dfsg-1 --2024-11-13 06:52:24-- http://deb.debian.org/debian/pool/main/v/veryfasttree/veryfasttree_4.0.4%2bdfsg-1.dsc Connecting to 46.16.76.132:3128... connected. Proxy request sent, awaiting response... 200 OK Length: 2137 (2.1K) [text/prs.lines.tag] Saving to: ‘veryfasttree_4.0.4+dfsg-1.dsc’ 0K .. 100% 304M=0s 2024-11-13 06:52:24 (304 MB/s) - ‘veryfasttree_4.0.4+dfsg-1.dsc’ saved [2137/2137] Wed Nov 13 06:52:24 UTC 2024 I: veryfasttree_4.0.4+dfsg-1.dsc -----BEGIN PGP SIGNED MESSAGE----- Hash: SHA512 Format: 3.0 (quilt) Source: veryfasttree Binary: veryfasttree Architecture: any Version: 4.0.4+dfsg-1 Maintainer: Debian Med Packaging Team Uploaders: César Pomar Homepage: https://github.com/citiususc/veryfasttree Standards-Version: 4.7.0 Vcs-Browser: https://salsa.debian.org/med-team/veryfasttree Vcs-Git: https://salsa.debian.org/med-team/veryfasttree.git Testsuite: autopkgtest Build-Depends: debhelper-compat (= 13), cmake, libboost-dev, libbz2-dev, robin-map-dev, libxxhash-dev, zlib1g-dev Package-List: veryfasttree deb science optional arch=any Checksums-Sha1: 7c0a092d9241ec3690eb30f8f33f0126993ca427 164136 veryfasttree_4.0.4+dfsg.orig.tar.xz d388edf111767e5747b0d456d440a091e0e8684c 29776 veryfasttree_4.0.4+dfsg-1.debian.tar.xz Checksums-Sha256: 576e5ab5ab05bf56d74082fae424d3fabf6508878c4235bf310bdce450e7d01b 164136 veryfasttree_4.0.4+dfsg.orig.tar.xz 0b981e14a99a2b69d95bc60782c07c57a5d9170e7f5c50abd165be8ce700feda 29776 veryfasttree_4.0.4+dfsg-1.debian.tar.xz Files: 6b11cb3b70851838ea4429b519eefa79 164136 veryfasttree_4.0.4+dfsg.orig.tar.xz b5852de91fff2dd31232eb369f9152d9 29776 veryfasttree_4.0.4+dfsg-1.debian.tar.xz -----BEGIN PGP SIGNATURE----- iQJIBAEBCgAyFiEEj5GyJ8fW8rGUjII2eTz2fo8NEdoFAmcmevEUHGVtb2xsaWVy QGRlYmlhbi5vcmcACgkQeTz2fo8NEdrB8w//aHOQVM5I2ZET6HZqdfe1e+O4yQLZ 0nqUwCWc29iRT1S1r4r8tm3d/l1c9CvEYejGT2uws6tGmhk+hivyg2PuheM632Sb EyoyKCbhSGTbePzrGGI8hsNF9xLmXnkFVJg4OUQ6YESc/6PqL80fckG9I1k1Ckz1 Tg/AKEqqLCVzK24shlQXZ0Cyhdx/FLi6PKQoLaGtJhhQ4o3q8qIgOaL0PuoqiIRJ Nd6JCdkIlnuS3XcRJdEgFn20HiEdPWSFpeES5m2looOWvfFIsYwkxs20dzVl6kFD O0jfz4gi3YREHzBcbMpgasjg/IugADDexgLKfflI4EAlCj76CEGtFJswOY4MK2Tg D31rdB80ZOoqVmGZyPctgXSVW084aD0nvILjLGQpO3ltVgxwCOoQeVaIHyqctCQW xQpaJQyj/8+qdVCWwmxzqNHlUcec5QLidu1KcTZabL1USPsFcGfZzl6BUyhNH8rq oTNVl4BPsgB9hp9UxwhE+zcBLoEWqqY6lbDR6v63ym/dnM6WzzpIdIsVC8qZrXsi C51I3Srsef64ws0h/+O0YjyrLRIrzVQ5EGCy0Kuep7Y/CC68fr5v9syL6WdgaSAJ dvX6YoQrRnFNvNRNXaogApk5sJpdmF7omyRaQSCSYwTRUix9/Ti9GgYa8aENpIZD QMMKvtaeF4Re3GE= =0uoh -----END PGP SIGNATURE----- Wed Nov 13 06:52:24 UTC 2024 I: Checking whether the package is not for us Wed Nov 13 06:52:24 UTC 2024 I: Starting 1st build on remote node ff64a-armhf-rb.debian.net. Wed Nov 13 06:52:24 UTC 2024 I: Preparing to do remote build '1' on ff64a-armhf-rb.debian.net. Wed Nov 13 07:03:30 UTC 2024 I: Deleting $TMPDIR on ff64a-armhf-rb.debian.net. 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: Building the build Environment I: extracting base tarball [/var/cache/pbuilder/trixie-reproducible-base.tgz] I: copying local configuration W: --override-config is not set; not updating apt.conf Read the manpage for details. I: mounting /proc filesystem I: mounting /sys filesystem I: creating /{dev,run}/shm I: mounting /dev/pts filesystem I: redirecting /dev/ptmx to /dev/pts/ptmx I: policy-rc.d already exists I: Copying source file I: copying [veryfasttree_4.0.4+dfsg-1.dsc] I: copying [./veryfasttree_4.0.4+dfsg.orig.tar.xz] I: copying [./veryfasttree_4.0.4+dfsg-1.debian.tar.xz] I: Extracting source gpgv: Signature made Sat Nov 2 19:18:09 2024 gpgv: using RSA key 8F91B227C7D6F2B1948C8236793CF67E8F0D11DA gpgv: issuer "emollier@debian.org" gpgv: Can't check signature: No public key dpkg-source: warning: cannot verify inline signature for ./veryfasttree_4.0.4+dfsg-1.dsc: no acceptable signature found dpkg-source: info: extracting veryfasttree in veryfasttree-4.0.4+dfsg dpkg-source: info: unpacking veryfasttree_4.0.4+dfsg.orig.tar.xz 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: 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' 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='> ' 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/' I: uname -a Linux ff64a 6.1.0-27-arm64 #1 SMP Debian 6.1.115-1 (2024-11-01) aarch64 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 -> Attempting to satisfy build-dependencies -> Creating pbuilder-satisfydepends-dummy package Package: pbuilder-satisfydepends-dummy Version: 0.invalid.0 Architecture: armhf Maintainer: Debian Pbuilder Team Description: Dummy package to satisfy dependencies with aptitude - created by pbuilder This package was created automatically by pbuilder to satisfy the build-dependencies of the package being currently built. Depends: debhelper-compat (= 13), cmake, libboost-dev, libbz2-dev, robin-map-dev, libxxhash-dev, zlib1g-dev dpkg-deb: building package 'pbuilder-satisfydepends-dummy' in '/tmp/satisfydepends-aptitude/pbuilder-satisfydepends-dummy.deb'. Selecting previously unselected package pbuilder-satisfydepends-dummy. (Reading database ... 19690 files and directories currently installed.) Preparing to unpack .../pbuilder-satisfydepends-dummy.deb ... Unpacking pbuilder-satisfydepends-dummy (0.invalid.0) ... dpkg: pbuilder-satisfydepends-dummy: dependency problems, but configuring anyway as you requested: pbuilder-satisfydepends-dummy depends on debhelper-compat (= 13); however: Package debhelper-compat is not installed. pbuilder-satisfydepends-dummy depends on cmake; however: Package cmake is not installed. pbuilder-satisfydepends-dummy depends on libboost-dev; however: Package libboost-dev is not installed. pbuilder-satisfydepends-dummy depends on libbz2-dev; however: Package libbz2-dev is not installed. pbuilder-satisfydepends-dummy depends on robin-map-dev; however: Package robin-map-dev is not installed. pbuilder-satisfydepends-dummy depends on libxxhash-dev; however: Package libxxhash-dev is not installed. pbuilder-satisfydepends-dummy depends on zlib1g-dev; however: Package zlib1g-dev is not installed. Setting up pbuilder-satisfydepends-dummy (0.invalid.0) ... Reading package lists... Building dependency tree... Reading state information... Initializing package states... Writing extended state information... Building tag database... pbuilder-satisfydepends-dummy is already installed at the requested version (0.invalid.0) pbuilder-satisfydepends-dummy is already installed at the requested version (0.invalid.0) The following NEW packages will be installed: autoconf{a} automake{a} autopoint{a} autotools-dev{a} bsdextrautils{a} cmake{a} cmake-data{a} debhelper{a} dh-autoreconf{a} dh-strip-nondeterminism{a} dwz{a} file{a} gettext{a} gettext-base{a} groff-base{a} intltool-debian{a} libarchive-zip-perl{a} libarchive13t64{a} libboost-dev{a} libboost1.83-dev{a} libbrotli1{a} libbz2-dev{a} libcom-err2{a} libcurl4t64{a} libdebhelper-perl{a} libelf1t64{a} libexpat1{a} libfile-stripnondeterminism-perl{a} libgssapi-krb5-2{a} libicu72{a} libjsoncpp26{a} libk5crypto3{a} libkeyutils1{a} libkrb5-3{a} libkrb5support0{a} libldap-2.5-0{a} libmagic-mgc{a} libmagic1t64{a} libnghttp2-14{a} libpipeline1{a} libproc2-0{a} libpsl5t64{a} librhash1{a} librtmp1{a} libsasl2-2{a} libsasl2-modules-db{a} libssh2-1t64{a} libtool{a} libuchardet0{a} libuv1t64{a} libxml2{a} libxxhash-dev{a} m4{a} man-db{a} po-debconf{a} procps{a} robin-map-dev{a} sensible-utils{a} zlib1g-dev{a} The following packages are RECOMMENDED but will NOT be installed: bzip2-doc ca-certificates curl krb5-locales libarchive-cpio-perl libldap-common libltdl-dev libmail-sendmail-perl libsasl2-modules linux-sysctl-defaults lynx psmisc publicsuffix wget 0 packages upgraded, 59 newly installed, 0 to remove and 0 not upgraded. Need to get 41.8 MB of archives. After unpacking 276 MB will be used. Writing extended state information... Get: 1 http://deb.debian.org/debian trixie/main armhf libproc2-0 armhf 2:4.0.4-6 [56.0 kB] Get: 2 http://deb.debian.org/debian trixie/main armhf procps armhf 2:4.0.4-6 [864 kB] Get: 3 http://deb.debian.org/debian trixie/main armhf sensible-utils all 0.0.24 [24.8 kB] Get: 4 http://deb.debian.org/debian trixie/main armhf libmagic-mgc armhf 1:5.45-3+b1 [314 kB] Get: 5 http://deb.debian.org/debian trixie/main armhf libmagic1t64 armhf 1:5.45-3+b1 [98.5 kB] Get: 6 http://deb.debian.org/debian trixie/main armhf file armhf 1:5.45-3+b1 [42.3 kB] Get: 7 http://deb.debian.org/debian trixie/main armhf gettext-base armhf 0.22.5-2 [195 kB] Get: 8 http://deb.debian.org/debian trixie/main armhf libuchardet0 armhf 0.0.8-1+b2 [65.6 kB] Get: 9 http://deb.debian.org/debian trixie/main armhf groff-base armhf 1.23.0-5 [1091 kB] Get: 10 http://deb.debian.org/debian trixie/main armhf bsdextrautils armhf 2.40.2-9 [88.8 kB] Get: 11 http://deb.debian.org/debian trixie/main armhf libpipeline1 armhf 1.5.8-1 [35.0 kB] Get: 12 http://deb.debian.org/debian trixie/main armhf man-db armhf 2.13.0-1 [1382 kB] Get: 13 http://deb.debian.org/debian trixie/main armhf m4 armhf 1.4.19-4 [264 kB] Get: 14 http://deb.debian.org/debian trixie/main armhf autoconf all 2.72-3 [493 kB] Get: 15 http://deb.debian.org/debian trixie/main armhf autotools-dev all 20220109.1 [51.6 kB] Get: 16 http://deb.debian.org/debian trixie/main armhf automake all 1:1.16.5-1.3 [823 kB] Get: 17 http://deb.debian.org/debian trixie/main armhf autopoint all 0.22.5-2 [723 kB] Get: 18 http://deb.debian.org/debian trixie/main armhf cmake-data all 3.30.5-1 [2223 kB] Get: 19 http://deb.debian.org/debian trixie/main armhf libicu72 armhf 72.1-5+b1 [9088 kB] Get: 20 http://deb.debian.org/debian trixie/main armhf libxml2 armhf 2.12.7+dfsg+really2.9.14-0.1 [604 kB] Get: 21 http://deb.debian.org/debian trixie/main armhf libarchive13t64 armhf 3.7.4-1.1 [306 kB] Get: 22 http://deb.debian.org/debian trixie/main armhf libbrotli1 armhf 1.1.0-2+b5 [296 kB] Get: 23 http://deb.debian.org/debian trixie/main armhf libkrb5support0 armhf 1.21.3-3 [30.0 kB] Get: 24 http://deb.debian.org/debian trixie/main armhf libcom-err2 armhf 1.47.1-1+b1 [22.3 kB] Get: 25 http://deb.debian.org/debian trixie/main armhf libk5crypto3 armhf 1.21.3-3 [75.8 kB] Get: 26 http://deb.debian.org/debian trixie/main armhf libkeyutils1 armhf 1.6.3-4 [8096 B] Get: 27 http://deb.debian.org/debian trixie/main armhf libkrb5-3 armhf 1.21.3-3 [283 kB] Get: 28 http://deb.debian.org/debian trixie/main armhf libgssapi-krb5-2 armhf 1.21.3-3 [114 kB] Get: 29 http://deb.debian.org/debian trixie/main armhf libsasl2-modules-db armhf 2.1.28+dfsg1-8 [18.2 kB] Get: 30 http://deb.debian.org/debian trixie/main armhf libsasl2-2 armhf 2.1.28+dfsg1-8 [50.2 kB] Get: 31 http://deb.debian.org/debian trixie/main armhf libldap-2.5-0 armhf 2.5.18+dfsg-3+b1 [163 kB] Get: 32 http://deb.debian.org/debian trixie/main armhf libnghttp2-14 armhf 1.64.0-1 [62.9 kB] Get: 33 http://deb.debian.org/debian trixie/main armhf libpsl5t64 armhf 0.21.2-1.1+b1 [55.8 kB] Get: 34 http://deb.debian.org/debian trixie/main armhf librtmp1 armhf 2.4+20151223.gitfa8646d.1-2+b5 [53.2 kB] Get: 35 http://deb.debian.org/debian trixie/main armhf libssh2-1t64 armhf 1.11.1-1 [227 kB] Get: 36 http://deb.debian.org/debian trixie/main armhf libcurl4t64 armhf 8.11.0-1 [303 kB] Get: 37 http://deb.debian.org/debian trixie/main armhf libexpat1 armhf 2.6.3-2 [83.1 kB] Get: 38 http://deb.debian.org/debian trixie/main armhf libjsoncpp26 armhf 1.9.6-2 [70.0 kB] Get: 39 http://deb.debian.org/debian trixie/main armhf librhash1 armhf 1.4.5-1 [143 kB] Get: 40 http://deb.debian.org/debian trixie/main armhf libuv1t64 armhf 1.48.0-7 [134 kB] Get: 41 http://deb.debian.org/debian trixie/main armhf cmake armhf 3.30.5-1 [5365 kB] Get: 42 http://deb.debian.org/debian trixie/main armhf libdebhelper-perl all 13.20 [89.7 kB] Get: 43 http://deb.debian.org/debian trixie/main armhf libtool all 2.4.7-8 [517 kB] Get: 44 http://deb.debian.org/debian trixie/main armhf dh-autoreconf all 20 [17.1 kB] Get: 45 http://deb.debian.org/debian trixie/main armhf libarchive-zip-perl all 1.68-1 [104 kB] Get: 46 http://deb.debian.org/debian trixie/main armhf libfile-stripnondeterminism-perl all 1.14.0-1 [19.5 kB] Get: 47 http://deb.debian.org/debian trixie/main armhf dh-strip-nondeterminism all 1.14.0-1 [8448 B] Get: 48 http://deb.debian.org/debian trixie/main armhf libelf1t64 armhf 0.192-4 [184 kB] Get: 49 http://deb.debian.org/debian trixie/main armhf dwz armhf 0.15-1+b2 [106 kB] Get: 50 http://deb.debian.org/debian trixie/main armhf gettext armhf 0.22.5-2 [1485 kB] Get: 51 http://deb.debian.org/debian trixie/main armhf intltool-debian all 0.35.0+20060710.6 [22.9 kB] Get: 52 http://deb.debian.org/debian trixie/main armhf po-debconf all 1.0.21+nmu1 [248 kB] Get: 53 http://deb.debian.org/debian trixie/main armhf debhelper all 13.20 [915 kB] Get: 54 http://deb.debian.org/debian trixie/main armhf libboost1.83-dev armhf 1.83.0-3.2 [10.6 MB] Get: 55 http://deb.debian.org/debian trixie/main armhf libboost-dev armhf 1.83.0.2+b2 [3832 B] Get: 56 http://deb.debian.org/debian trixie/main armhf libbz2-dev armhf 1.0.8-6 [28.7 kB] 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) 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.) Preparing to unpack .../00-libproc2-0_2%3a4.0.4-6_armhf.deb ... Unpacking libproc2-0:armhf (2:4.0.4-6) ... Selecting previously unselected package procps. Preparing to unpack .../01-procps_2%3a4.0.4-6_armhf.deb ... Unpacking procps (2:4.0.4-6) ... Selecting previously unselected package sensible-utils. Preparing to unpack .../02-sensible-utils_0.0.24_all.deb ... Unpacking sensible-utils (0.0.24) ... Selecting previously unselected package libmagic-mgc. Preparing to unpack .../03-libmagic-mgc_1%3a5.45-3+b1_armhf.deb ... Unpacking libmagic-mgc (1:5.45-3+b1) ... Selecting previously unselected package libmagic1t64:armhf. Preparing to unpack .../04-libmagic1t64_1%3a5.45-3+b1_armhf.deb ... Unpacking libmagic1t64:armhf (1:5.45-3+b1) ... Selecting previously unselected package file. Preparing to unpack .../05-file_1%3a5.45-3+b1_armhf.deb ... Unpacking file (1:5.45-3+b1) ... Selecting previously unselected package gettext-base. Preparing to unpack .../06-gettext-base_0.22.5-2_armhf.deb ... Unpacking gettext-base (0.22.5-2) ... Selecting previously unselected package libuchardet0:armhf. Preparing to unpack .../07-libuchardet0_0.0.8-1+b2_armhf.deb ... Unpacking libuchardet0:armhf (0.0.8-1+b2) ... Selecting previously unselected package groff-base. Preparing to unpack .../08-groff-base_1.23.0-5_armhf.deb ... Unpacking groff-base (1.23.0-5) ... Selecting previously unselected package bsdextrautils. Preparing to unpack .../09-bsdextrautils_2.40.2-9_armhf.deb ... Unpacking bsdextrautils (2.40.2-9) ... Selecting previously unselected package libpipeline1:armhf. Preparing to unpack .../10-libpipeline1_1.5.8-1_armhf.deb ... Unpacking libpipeline1:armhf (1.5.8-1) ... Selecting previously unselected package man-db. Preparing to unpack .../11-man-db_2.13.0-1_armhf.deb ... Unpacking man-db (2.13.0-1) ... Selecting previously unselected package m4. Preparing to unpack .../12-m4_1.4.19-4_armhf.deb ... Unpacking m4 (1.4.19-4) ... Selecting previously unselected package autoconf. Preparing to unpack .../13-autoconf_2.72-3_all.deb ... Unpacking autoconf (2.72-3) ... Selecting previously unselected package autotools-dev. Preparing to unpack .../14-autotools-dev_20220109.1_all.deb ... Unpacking autotools-dev (20220109.1) ... Selecting previously unselected package automake. Preparing to unpack .../15-automake_1%3a1.16.5-1.3_all.deb ... Unpacking automake (1:1.16.5-1.3) ... Selecting previously unselected package autopoint. Preparing to unpack .../16-autopoint_0.22.5-2_all.deb ... Unpacking autopoint (0.22.5-2) ... Selecting previously unselected package cmake-data. Preparing to unpack .../17-cmake-data_3.30.5-1_all.deb ... Unpacking cmake-data (3.30.5-1) ... Selecting previously unselected package libicu72:armhf. Preparing to unpack .../18-libicu72_72.1-5+b1_armhf.deb ... Unpacking libicu72:armhf (72.1-5+b1) ... Selecting previously unselected package libxml2:armhf. Preparing to unpack .../19-libxml2_2.12.7+dfsg+really2.9.14-0.1_armhf.deb ... Unpacking libxml2:armhf (2.12.7+dfsg+really2.9.14-0.1) ... Selecting previously unselected package libarchive13t64:armhf. Preparing to unpack .../20-libarchive13t64_3.7.4-1.1_armhf.deb ... Unpacking libarchive13t64:armhf (3.7.4-1.1) ... Selecting previously unselected package libbrotli1:armhf. Preparing to unpack .../21-libbrotli1_1.1.0-2+b5_armhf.deb ... Unpacking libbrotli1:armhf (1.1.0-2+b5) ... Selecting previously unselected package libkrb5support0:armhf. Preparing to unpack .../22-libkrb5support0_1.21.3-3_armhf.deb ... Unpacking libkrb5support0:armhf (1.21.3-3) ... Selecting previously unselected package libcom-err2:armhf. Preparing to unpack .../23-libcom-err2_1.47.1-1+b1_armhf.deb ... Unpacking libcom-err2:armhf (1.47.1-1+b1) ... Selecting previously unselected package libk5crypto3:armhf. Preparing to unpack .../24-libk5crypto3_1.21.3-3_armhf.deb ... Unpacking libk5crypto3:armhf (1.21.3-3) ... Selecting previously unselected package libkeyutils1:armhf. Preparing to unpack .../25-libkeyutils1_1.6.3-4_armhf.deb ... Unpacking libkeyutils1:armhf (1.6.3-4) ... Selecting previously unselected package libkrb5-3:armhf. Preparing to unpack .../26-libkrb5-3_1.21.3-3_armhf.deb ... Unpacking libkrb5-3:armhf (1.21.3-3) ... Selecting previously unselected package libgssapi-krb5-2:armhf. Preparing to unpack .../27-libgssapi-krb5-2_1.21.3-3_armhf.deb ... Unpacking libgssapi-krb5-2:armhf (1.21.3-3) ... Selecting previously unselected package libsasl2-modules-db:armhf. Preparing to unpack .../28-libsasl2-modules-db_2.1.28+dfsg1-8_armhf.deb ... Unpacking libsasl2-modules-db:armhf (2.1.28+dfsg1-8) ... Selecting previously unselected package libsasl2-2:armhf. Preparing to unpack .../29-libsasl2-2_2.1.28+dfsg1-8_armhf.deb ... Unpacking libsasl2-2:armhf (2.1.28+dfsg1-8) ... Selecting previously unselected package libldap-2.5-0:armhf. Preparing to unpack .../30-libldap-2.5-0_2.5.18+dfsg-3+b1_armhf.deb ... Unpacking libldap-2.5-0:armhf (2.5.18+dfsg-3+b1) ... Selecting previously unselected package libnghttp2-14:armhf. Preparing to unpack .../31-libnghttp2-14_1.64.0-1_armhf.deb ... Unpacking libnghttp2-14:armhf (1.64.0-1) ... Selecting previously unselected package libpsl5t64:armhf. Preparing to unpack .../32-libpsl5t64_0.21.2-1.1+b1_armhf.deb ... Unpacking libpsl5t64:armhf (0.21.2-1.1+b1) ... Selecting previously unselected package librtmp1:armhf. Preparing to unpack .../33-librtmp1_2.4+20151223.gitfa8646d.1-2+b5_armhf.deb ... Unpacking librtmp1:armhf (2.4+20151223.gitfa8646d.1-2+b5) ... Selecting previously unselected package libssh2-1t64:armhf. Preparing to unpack .../34-libssh2-1t64_1.11.1-1_armhf.deb ... Unpacking libssh2-1t64:armhf (1.11.1-1) ... Selecting previously unselected package libcurl4t64:armhf. Preparing to unpack .../35-libcurl4t64_8.11.0-1_armhf.deb ... Unpacking libcurl4t64:armhf (8.11.0-1) ... Selecting previously unselected package libexpat1:armhf. Preparing to unpack .../36-libexpat1_2.6.3-2_armhf.deb ... Unpacking libexpat1:armhf (2.6.3-2) ... Selecting previously unselected package libjsoncpp26:armhf. Preparing to unpack .../37-libjsoncpp26_1.9.6-2_armhf.deb ... Unpacking libjsoncpp26:armhf (1.9.6-2) ... Selecting previously unselected package librhash1:armhf. Preparing to unpack .../38-librhash1_1.4.5-1_armhf.deb ... Unpacking librhash1:armhf (1.4.5-1) ... Selecting previously unselected package libuv1t64:armhf. Preparing to unpack .../39-libuv1t64_1.48.0-7_armhf.deb ... Unpacking libuv1t64:armhf (1.48.0-7) ... Selecting previously unselected package cmake. Preparing to unpack .../40-cmake_3.30.5-1_armhf.deb ... Unpacking cmake (3.30.5-1) ... Selecting previously unselected package libdebhelper-perl. Preparing to unpack .../41-libdebhelper-perl_13.20_all.deb ... Unpacking libdebhelper-perl (13.20) ... Selecting previously unselected package libtool. Preparing to unpack .../42-libtool_2.4.7-8_all.deb ... Unpacking libtool (2.4.7-8) ... Selecting previously unselected package dh-autoreconf. Preparing to unpack .../43-dh-autoreconf_20_all.deb ... Unpacking dh-autoreconf (20) ... Selecting previously unselected package libarchive-zip-perl. Preparing to unpack .../44-libarchive-zip-perl_1.68-1_all.deb ... Unpacking libarchive-zip-perl (1.68-1) ... Selecting previously unselected package libfile-stripnondeterminism-perl. Preparing to unpack .../45-libfile-stripnondeterminism-perl_1.14.0-1_all.deb ... Unpacking libfile-stripnondeterminism-perl (1.14.0-1) ... Selecting previously unselected package dh-strip-nondeterminism. Preparing to unpack .../46-dh-strip-nondeterminism_1.14.0-1_all.deb ... Unpacking dh-strip-nondeterminism (1.14.0-1) ... Selecting previously unselected package libelf1t64:armhf. Preparing to unpack .../47-libelf1t64_0.192-4_armhf.deb ... Unpacking libelf1t64:armhf (0.192-4) ... Selecting previously unselected package dwz. Preparing to unpack .../48-dwz_0.15-1+b2_armhf.deb ... Unpacking dwz (0.15-1+b2) ... Selecting previously unselected package gettext. Preparing to unpack .../49-gettext_0.22.5-2_armhf.deb ... Unpacking gettext (0.22.5-2) ... Selecting previously unselected package intltool-debian. Preparing to unpack .../50-intltool-debian_0.35.0+20060710.6_all.deb ... Unpacking intltool-debian (0.35.0+20060710.6) ... Selecting previously unselected package po-debconf. Preparing to unpack .../51-po-debconf_1.0.21+nmu1_all.deb ... Unpacking po-debconf (1.0.21+nmu1) ... Selecting previously unselected package debhelper. Preparing to unpack .../52-debhelper_13.20_all.deb ... Unpacking debhelper (13.20) ... Selecting previously unselected package libboost1.83-dev:armhf. Preparing to unpack .../53-libboost1.83-dev_1.83.0-3.2_armhf.deb ... Unpacking libboost1.83-dev:armhf (1.83.0-3.2) ... Selecting previously unselected package libboost-dev:armhf. Preparing to unpack .../54-libboost-dev_1.83.0.2+b2_armhf.deb ... Unpacking libboost-dev:armhf (1.83.0.2+b2) ... Selecting previously unselected package libbz2-dev:armhf. Preparing to unpack .../55-libbz2-dev_1.0.8-6_armhf.deb ... Unpacking libbz2-dev:armhf (1.0.8-6) ... Selecting previously unselected package libxxhash-dev:armhf. Preparing to unpack .../56-libxxhash-dev_0.8.2-2+b2_armhf.deb ... Unpacking libxxhash-dev:armhf (0.8.2-2+b2) ... Selecting previously unselected package robin-map-dev. Preparing to unpack .../57-robin-map-dev_1.3.0-1_all.deb ... Unpacking robin-map-dev (1.3.0-1) ... Selecting previously unselected package zlib1g-dev:armhf. Preparing to unpack .../58-zlib1g-dev_1%3a1.3.dfsg+really1.3.1-1+b1_armhf.deb ... Unpacking zlib1g-dev:armhf (1:1.3.dfsg+really1.3.1-1+b1) ... Setting up libexpat1:armhf (2.6.3-2) ... Setting up libpipeline1:armhf (1.5.8-1) ... Setting up libkeyutils1:armhf (1.6.3-4) ... Setting up libboost1.83-dev:armhf (1.83.0-3.2) ... Setting up libicu72:armhf (72.1-5+b1) ... Setting up bsdextrautils (2.40.2-9) ... Setting up libmagic-mgc (1:5.45-3+b1) ... Setting up libarchive-zip-perl (1.68-1) ... Setting up libdebhelper-perl (13.20) ... Setting up libbrotli1:armhf (1.1.0-2+b5) ... Setting up libuv1t64:armhf (1.48.0-7) ... Setting up libmagic1t64:armhf (1:5.45-3+b1) ... Setting up libpsl5t64:armhf (0.21.2-1.1+b1) ... Setting up libnghttp2-14:armhf (1.64.0-1) ... Setting up gettext-base (0.22.5-2) ... Setting up m4 (1.4.19-4) ... Setting up libcom-err2:armhf (1.47.1-1+b1) ... Setting up file (1:5.45-3+b1) ... Setting up libelf1t64:armhf (0.192-4) ... Setting up libkrb5support0:armhf (1.21.3-3) ... Setting up libsasl2-modules-db:armhf (2.1.28+dfsg1-8) ... Setting up autotools-dev (20220109.1) ... Setting up librtmp1:armhf (2.4+20151223.gitfa8646d.1-2+b5) ... Setting up libjsoncpp26:armhf (1.9.6-2) ... Setting up libproc2-0:armhf (2:4.0.4-6) ... Setting up autopoint (0.22.5-2) ... Setting up libk5crypto3:armhf (1.21.3-3) ... Setting up libsasl2-2:armhf (2.1.28+dfsg1-8) ... Setting up autoconf (2.72-3) ... Setting up libxxhash-dev:armhf (0.8.2-2+b2) ... Setting up zlib1g-dev:armhf (1:1.3.dfsg+really1.3.1-1+b1) ... Setting up robin-map-dev (1.3.0-1) ... Setting up dwz (0.15-1+b2) ... Setting up sensible-utils (0.0.24) ... Setting up libuchardet0:armhf (0.0.8-1+b2) ... Setting up procps (2:4.0.4-6) ... Setting up cmake-data (3.30.5-1) ... Setting up librhash1:armhf (1.4.5-1) ... Setting up libkrb5-3:armhf (1.21.3-3) ... Setting up libboost-dev:armhf (1.83.0.2+b2) ... Setting up libssh2-1t64:armhf (1.11.1-1) ... Setting up libxml2:armhf (2.12.7+dfsg+really2.9.14-0.1) ... Setting up libbz2-dev:armhf (1.0.8-6) ... Setting up automake (1:1.16.5-1.3) ... update-alternatives: using /usr/bin/automake-1.16 to provide /usr/bin/automake (automake) in auto mode Setting up libfile-stripnondeterminism-perl (1.14.0-1) ... Setting up gettext (0.22.5-2) ... Setting up libtool (2.4.7-8) ... Setting up libldap-2.5-0:armhf (2.5.18+dfsg-3+b1) ... Setting up intltool-debian (0.35.0+20060710.6) ... Setting up dh-autoreconf (20) ... Setting up libgssapi-krb5-2:armhf (1.21.3-3) ... Setting up dh-strip-nondeterminism (1.14.0-1) ... Setting up groff-base (1.23.0-5) ... Setting up libarchive13t64:armhf (3.7.4-1.1) ... Setting up libcurl4t64:armhf (8.11.0-1) ... Setting up po-debconf (1.0.21+nmu1) ... Setting up man-db (2.13.0-1) ... Not building database; man-db/auto-update is not 'true'. Setting up cmake (3.30.5-1) ... Setting up debhelper (13.20) ... Processing triggers for libc-bin (2.40-3) ... Reading package lists... Building dependency tree... Reading state information... Reading extended state information... Initializing package states... Writing extended state information... 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 dpkg-buildpackage: info: source package veryfasttree dpkg-buildpackage: info: source version 4.0.4+dfsg-1 dpkg-buildpackage: info: source distribution unstable dpkg-buildpackage: info: source changed by Étienne Mollier dpkg-source --before-build . dpkg-buildpackage: info: host architecture armhf debian/rules clean dh clean debian/rules override_dh_auto_clean make[1]: Entering directory '/build/reproducible-path/veryfasttree-4.0.4+dfsg' dh_auto_clean rm -Rf build_* make[1]: Leaving directory '/build/reproducible-path/veryfasttree-4.0.4+dfsg' dh_clean debian/rules binary dh binary dh_update_autotools_config dh_autoreconf debian/rules override_dh_auto_configure make[1]: Entering directory '/build/reproducible-path/veryfasttree-4.0.4+dfsg' dh_auto_configure -- \ -DUSE_NATIVE=OFF -DUSE_SHARED=ON cd obj-arm-linux-gnueabihf && DEB_PYTHON_INSTALL_LAYOUT=deb PKG_CONFIG=/usr/bin/pkg-config cmake -DCMAKE_INSTALL_PREFIX=/usr -DCMAKE_BUILD_TYPE=None -DCMAKE_INSTALL_SYSCONFDIR=/etc -DCMAKE_INSTALL_LOCALSTATEDIR=/var -DCMAKE_EXPORT_NO_PACKAGE_REGISTRY=ON -DCMAKE_FIND_USE_PACKAGE_REGISTRY=OFF -DCMAKE_FIND_PACKAGE_NO_PACKAGE_REGISTRY=ON -DFETCHCONTENT_FULLY_DISCONNECTED=ON -DCMAKE_INSTALL_RUNSTATEDIR=/run -DCMAKE_SKIP_INSTALL_ALL_DEPENDENCY=ON "-GUnix Makefiles" -DCMAKE_VERBOSE_MAKEFILE=ON -DCMAKE_INSTALL_LIBDIR=lib/arm-linux-gnueabihf -DUSE_NATIVE=OFF -DUSE_SHARED=ON .. -- The C compiler identification is GNU 14.2.0 -- The CXX compiler identification is GNU 14.2.0 -- Detecting C compiler ABI info -- Detecting C compiler ABI info - done -- Check for working C compiler: /usr/bin/cc - skipped -- Detecting C compile features -- Detecting C compile features - done -- Detecting CXX compiler ABI info -- Detecting CXX compiler ABI info - done -- Check for working CXX compiler: /usr/bin/c++ - skipped -- Detecting CXX compile features -- Detecting CXX compile features - done -- 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) CMake Warning: Manually-specified variables were not used by the project: CMAKE_EXPORT_NO_PACKAGE_REGISTRY CMAKE_FIND_PACKAGE_NO_PACKAGE_REGISTRY CMAKE_INSTALL_LIBDIR CMAKE_INSTALL_LOCALSTATEDIR CMAKE_INSTALL_RUNSTATEDIR CMAKE_INSTALL_SYSCONFDIR FETCHCONTENT_FULLY_DISCONNECTED -- Build files have been written to: /build/reproducible-path/veryfasttree-4.0.4+dfsg/obj-arm-linux-gnueabihf make[1]: Leaving directory '/build/reproducible-path/veryfasttree-4.0.4+dfsg' 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 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 make -f CMakeFiles/Makefile2 all make[3]: Entering directory '/build/reproducible-path/veryfasttree-4.0.4+dfsg/obj-arm-linux-gnueabihf' make -f CMakeFiles/VeryFastTree.dir/build.make CMakeFiles/VeryFastTree.dir/depend make[4]: Entering directory '/build/reproducible-path/veryfasttree-4.0.4+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/veryfasttree-4.0.4+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/veryfasttree-4.0.4+dfsg /build/reproducible-path/veryfasttree-4.0.4+dfsg /build/reproducible-path/veryfasttree-4.0.4+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/veryfasttree-4.0.4+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/veryfasttree-4.0.4+dfsg/obj-arm-linux-gnueabihf/CMakeFiles/VeryFastTree.dir/DependInfo.cmake "--color=" 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 /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 /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 /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 /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 [ 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: /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>:: | ^~~~~~~~~~~~~~~~~~~ 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: /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::Uniquify::Uniquify(veryfasttree::Alignment&)' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/Alignment.cpp:502:21: /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/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 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 '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 = 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 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: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: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: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: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: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: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, | ^~~~~ 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 = double; _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 '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 /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/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, from /usr/include/c++/14/bits/locale_classes.h:40, from /usr/include/c++/14/bits/ios_base.h:41, from /usr/include/c++/14/ios:44, from /usr/include/c++/14/ostream:40, from /usr/include/c++/14/iostream:41, from /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../Utils.h:6: In member function 'void std::__new_allocator<_Tp>::deallocate(_Tp*, size_type) [with _Tp = std::_List_node]', inlined from 'static void std::allocator_traits >::deallocate(allocator_type&, pointer, size_type) [with _Tp = std::_List_node]' at /usr/include/c++/14/bits/alloc_traits.h:544:23, 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: /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]': /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: /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: /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: /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: /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: /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, from /usr/include/c++/14/bits/locale_classes.h:40, from /usr/include/c++/14/bits/ios_base.h:41, from /usr/include/c++/14/ios:44, from /usr/include/c++/14/ostream:40, from /usr/include/c++/14/iostream:41, from /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../Utils.h:6: In member function 'void std::__new_allocator<_Tp>::deallocate(_Tp*, size_type) [with _Tp = std::_List_node]', inlined from 'static void std::allocator_traits >::deallocate(allocator_type&, pointer, size_type) [with _Tp = std::_List_node]' at /usr/include/c++/14/bits/alloc_traits.h:544:23, 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: /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]': /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: /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: /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: /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: /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: /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 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: /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::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: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 = double; 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 = double; _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 = double; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:245:20: /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 = double; _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 = double; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:246:23: /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 = double; _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 = double; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:247:20: /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 = double; 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 = double; 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 member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _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 = double; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:269:24: /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 = double; _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 = double; Operations = veryfasttree::BasicOperations]' at /build/reproducible-path/veryfasttree-4.0.4+dfsg/src/impl/../NeighbourJoining.tcc:270:19: /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::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); } | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 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::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 = double; 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 = double; 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 = double; 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/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 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 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 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); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::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/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); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::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 = __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/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::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 | ^~~~~~~~~~~~~~~~~~~~~~~~~~ /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::CompareHitsByCriterion]', 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::CompareHitsByCriterion]' 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::CompareHitsByCriterion]', 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::CompareHitsByCriterion]' 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::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, 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::CompareHitsByCriterion>::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::CompareHitsByCriterion>::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::CompareHitsByCriterion>::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::CompareHitsByCriterion>::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::CompareHitsByCriterion>::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::CompareHitsByCriterion>::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::CompareHitsByCriterion>::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_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, 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::CompareHitsByCriterion]' 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::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: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::CompareHitsByCriterion]' 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::CompareHitsByCriterion]' 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::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: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::CompareHitsByCriterion]' 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::CompareHitsByCriterion]' 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: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); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::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/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); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::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 = __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/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::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 | ^~~~~~~~~~~~~~~~~~~~~~~~~~ /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::CompareHitsByCriterion]', 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::CompareHitsByCriterion]' 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::CompareHitsByCriterion]', 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::CompareHitsByCriterion]' 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::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, 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::CompareHitsByCriterion>::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::CompareHitsByCriterion>::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::CompareHitsByCriterion>::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::CompareHitsByCriterion>::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::CompareHitsByCriterion>::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::CompareHitsByCriterion>::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::CompareHitsByCriterion>::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_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, 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::CompareHitsByCriterion]' 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::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: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::CompareHitsByCriterion]' 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::CompareHitsByCriterion]' 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::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: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::CompareHitsByCriterion]' 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::CompareHitsByCriterion]' 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: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 /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); | ~~~~~~~~~~~~~~~~~ /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); | ~~~~~~~~~~~~~~~~~ /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 >; 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/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 '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 = float; 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 = float; 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 = float; 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); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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 '_ZN12veryfasttree16NeighbourJoiningIfNS_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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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 = float; 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 '_ZN12veryfasttree16NeighbourJoiningIfNS_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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 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: /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 = float; 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ [100%] Linking CXX executable VeryFastTree /usr/bin/cmake -E cmake_link_script CMakeFiles/VeryFastTree.dir/link.txt --verbose=1 /usr/bin/c++ -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 -Wl,-z,relro -Wl,-z,now CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeDouble.cpp.o CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeDoubleAVX256.cpp.o CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeDoubleAVX512.cpp.o CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeDoubleCuda.cpp.o CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeDoubleSSE128.cpp.o CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeFloat.cpp.o CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeFloatAVX256.cpp.o CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeFloatAVX512.cpp.o CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeFloatCuda.cpp.o CMakeFiles/VeryFastTree.dir/src/impl/VeryFastTreeFloatSSE128.cpp.o CMakeFiles/VeryFastTree.dir/src/Knuth.cpp.o CMakeFiles/VeryFastTree.dir/src/DiskMemory.cpp.o CMakeFiles/VeryFastTree.dir/src/Alignment.cpp.o CMakeFiles/VeryFastTree.dir/src/VeryFastTree.cpp.o CMakeFiles/VeryFastTree.dir/main.cpp.o -o VeryFastTree -lz -lbz2 /usr/lib/gcc/arm-linux-gnueabihf/14/libgomp.so /usr/lib/arm-linux-gnueabihf/libpthread.a make[4]: Leaving directory '/build/reproducible-path/veryfasttree-4.0.4+dfsg/obj-arm-linux-gnueabihf' [100%] Built target VeryFastTree make[3]: Leaving directory '/build/reproducible-path/veryfasttree-4.0.4+dfsg/obj-arm-linux-gnueabihf' /usr/bin/cmake -E cmake_progress_start /build/reproducible-path/veryfasttree-4.0.4+dfsg/obj-arm-linux-gnueabihf/CMakeFiles 0 make[2]: Leaving directory '/build/reproducible-path/veryfasttree-4.0.4+dfsg/obj-arm-linux-gnueabihf' make[1]: Leaving directory '/build/reproducible-path/veryfasttree-4.0.4+dfsg' dh_auto_test create-stamp debian/debhelper-build-stamp dh_prep 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" 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 make[3]: Entering directory '/build/reproducible-path/veryfasttree-4.0.4+dfsg/obj-arm-linux-gnueabihf' make[3]: Nothing to be done for 'preinstall'. make[3]: Leaving directory '/build/reproducible-path/veryfasttree-4.0.4+dfsg/obj-arm-linux-gnueabihf' Install the project... /usr/bin/cmake -P cmake_install.cmake -- Install configuration: "None" -- Installing: /build/reproducible-path/veryfasttree-4.0.4+dfsg/debian/veryfasttree/usr/bin/VeryFastTree make[2]: Leaving directory '/build/reproducible-path/veryfasttree-4.0.4+dfsg/obj-arm-linux-gnueabihf' make[1]: Leaving directory '/build/reproducible-path/veryfasttree-4.0.4+dfsg' dh_installdocs dh_installchangelogs dh_installman dh_perl dh_link dh_strip_nondeterminism dh_compress dh_fixperms dh_missing dh_dwz -a dh_strip -a dh_makeshlibs -a dh_shlibdeps -a dpkg-shlibdeps: warning: diversions involved - output may be incorrect diversion by libc6 from: /lib/ld-linux-armhf.so.3 dpkg-shlibdeps: warning: diversions involved - output may be incorrect diversion by libc6 to: /lib/ld-linux-armhf.so.3.usr-is-merged dpkg-shlibdeps: warning: debian/veryfasttree/usr/bin/VeryFastTree contains an unresolvable reference to symbol __aeabi_atexit@CXXABI_ARM_1.3.3: it's probably a plugin dh_installdeb 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-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) dpkg-source --after-build . dpkg-buildpackage: info: binary-only upload (no source included) dpkg-genchanges: info: including full source code in upload I: copying local configuration 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 Wed Nov 13 07:03:35 UTC 2024 I: 1st build successful. Starting 2nd build on remote node virt32a-armhf-rb.debian.net. Wed Nov 13 07:03:35 UTC 2024 I: Preparing to do remote build '2' on virt32a-armhf-rb.debian.net. Wed Nov 13 07:11:03 UTC 2024 I: Deleting $TMPDIR on virt32a-armhf-rb.debian.net. Wed Nov 13 07:11:06 UTC 2024 I: veryfasttree_4.0.4+dfsg-1_armhf.changes: Format: 1.8 Date: Sat, 02 Nov 2024 17:03:57 +0100 Source: veryfasttree Binary: veryfasttree veryfasttree-dbgsym Architecture: armhf Version: 4.0.4+dfsg-1 Distribution: unstable Urgency: medium Maintainer: Debian Med Packaging Team Changed-By: Étienne Mollier Description: veryfasttree - Speeding up the estimation of phylogenetic trees from sequences Changes: veryfasttree (4.0.4+dfsg-1) unstable; urgency=medium . * Team upload. * New upstream version 4.0.4+dfsg * d/manpages: use newly introduced manual pages upstream. * d/VeryFastTree.1: delete: maintainer manual is now unneeded. * d/control: declare compliance to standards version 4.7.0. * d/copyright: update upstream copyright years. Checksums-Sha1: 43928f1ad9cc71eaef75d398f7fb0105de1b3aef 6778664 veryfasttree-dbgsym_4.0.4+dfsg-1_armhf.deb 8612de594063fed71d769bad803d4137e5d23b50 6045 veryfasttree_4.0.4+dfsg-1_armhf.buildinfo 5b9f0349889fa059683d1614a46097ba7477c4cd 517292 veryfasttree_4.0.4+dfsg-1_armhf.deb Checksums-Sha256: 5ab7d075128b28d2e7815ee0a0b9adaf9867559998d67f649e0e4b9cff8b0e9c 6778664 veryfasttree-dbgsym_4.0.4+dfsg-1_armhf.deb fbc00cb1cd1bdbe73a314c3c04903725763f7ac17a8a31a4ff5d40f6bfab0bf9 6045 veryfasttree_4.0.4+dfsg-1_armhf.buildinfo ae2e30b0949fb2779e776d8b357d8b39dc700e8e1ccc73067ee8ca51c07f8ed7 517292 veryfasttree_4.0.4+dfsg-1_armhf.deb Files: 89034a4623ebc1a880959d7a8e84f6bc 6778664 debug optional veryfasttree-dbgsym_4.0.4+dfsg-1_armhf.deb 911a8453343c8148331eebb5750c5695 6045 science optional veryfasttree_4.0.4+dfsg-1_armhf.buildinfo 2616b98b982a631f536ec8f9c2fdd678 517292 science optional veryfasttree_4.0.4+dfsg-1_armhf.deb Wed Nov 13 07:11:07 UTC 2024 I: diffoscope 283 will be used to compare the two builds: Running as unit: rb-diffoscope-armhf_18-8468.service # Profiling output for: /usr/bin/diffoscope --timeout 7200 --html /srv/reproducible-results/rbuild-debian/r-b-build.rcoAuJco/veryfasttree_4.0.4+dfsg-1.diffoscope.html --text /srv/reproducible-results/rbuild-debian/r-b-build.rcoAuJco/veryfasttree_4.0.4+dfsg-1.diffoscope.txt --json /srv/reproducible-results/rbuild-debian/r-b-build.rcoAuJco/veryfasttree_4.0.4+dfsg-1.diffoscope.json --profile=- /srv/reproducible-results/rbuild-debian/r-b-build.rcoAuJco/b1/veryfasttree_4.0.4+dfsg-1_armhf.changes /srv/reproducible-results/rbuild-debian/r-b-build.rcoAuJco/b2/veryfasttree_4.0.4+dfsg-1_armhf.changes ## command (total time: 0.000s) 0.000s 1 call cmp (internal) ## has_same_content_as (total time: 0.000s) 0.000s 1 call abc.DotChangesFile ## main (total time: 0.475s) 0.475s 2 calls outputs 0.000s 1 call cleanup ## recognizes (total time: 0.092s) 0.092s 12 calls diffoscope.comparators.binary.FilesystemFile ## specialize (total time: 0.000s) 0.000s 1 call specialize Finished with result: success Main processes terminated with: code=exited/status=0 Service runtime: 810ms CPU time consumed: 791ms Wed Nov 13 07:11:08 UTC 2024 I: diffoscope 283 found no differences in the changes files, and a .buildinfo file also exists. Wed Nov 13 07:11:08 UTC 2024 I: veryfasttree from trixie built successfully and reproducibly on armhf. Wed Nov 13 07:11:09 UTC 2024 I: Submitting .buildinfo files to external archives: Wed Nov 13 07:11:09 UTC 2024 I: Submitting 8.0K b1/veryfasttree_4.0.4+dfsg-1_armhf.buildinfo.asc Wed Nov 13 07:11:10 UTC 2024 I: Submitting 8.0K b2/veryfasttree_4.0.4+dfsg-1_armhf.buildinfo.asc Wed Nov 13 07:11:11 UTC 2024 I: Done submitting .buildinfo files to http://buildinfo.debian.net/api/submit. Wed Nov 13 07:11:11 UTC 2024 I: Done submitting .buildinfo files. Wed Nov 13 07:11:11 UTC 2024 I: Removing signed veryfasttree_4.0.4+dfsg-1_armhf.buildinfo.asc files: removed './b1/veryfasttree_4.0.4+dfsg-1_armhf.buildinfo.asc' removed './b2/veryfasttree_4.0.4+dfsg-1_armhf.buildinfo.asc'